MULTILEVEL MODAL VALUE ANALYSIS FOR INTERPRETING CATEGORICAL K-MEDOIDS CLUSTERS DATA
DOI:
https://doi.org/10.33480/techno.v21i2.5796Keywords:
Categorical Data Type, Cluster Interpretation, Davies-Bouldin Index, K-Medoid, Modal Value, SegmentationAbstract
Consumer segmentation plays a crucial role for business owners in developing their enterprises. K-Medoid is commonly used for segmentation functions due to its low computational complexity. However, K-Medoid has limitations, such as the variability in cluster sizes across different iterations and the challenge of determining the optimal number of clusters. The Davies-Bouldin Index (DBI) is a metric used to evaluate the number of clusters by calculating the ratio between the within-cluster distance and the between-cluster distance. Most segmentation studies typically stop at the formation of clusters without further interpretation, particularly when dealing with categorical data. This study aims to modify the use of K-Medoid and propose a method for interpreting clusters with categorical data. The research began with questionnaire design and the data collecting from 100 respondents, which was normalized in the second stage. Clustering used K-Medoid with variations K values from K=2 to K=10, with each K value tested 10 times. The clustering results were evaluated using the DBI to select the optimal clusters. Data interpretation conducted using modal values, calculated as the ratio of the number of times a specific attribute variable was selected by respondents to the total number of data points in the cluster. Utilization and hierarchical visualization of modal values proposed in this study offer insights into the dominant variables within an attribute and also depict the relationships between attributes based on the ranking of modal values. These advantages facilitate business analysts in labeling clusters for developing consumer-driven business strategies.
References
Abdulhafedh, A. (2021). Incorporating K-means, Hierarchical Clustering and PCA in Customer Segmentation. Journal of City and Development, Vol.3(1), 12–30. https://doi.org/10.12691/jcd-3-1-3
Anggraini, R. A., Wati, F. F., Shidiq, M. J., Suryadi, A., Fatah, H., & Kholifah, D. N. (2020). Identification of Herbal Plant Based on Leaf Image Using GLCM Feature and K-Means. Jurnal Techno Nusa Mandiri, 17(1), 71–78. https://doi.org/10.33480/techno.v17i1.1087
Berahmana, R. W. B. S., Mohammed, F. A., & Chairuang, K. (2020). Customer Segmentation Based on RFM Model Using K-Means, K-Medoids, and DBSCAN Methods. Lontar Komputer : Jurnal Ilmiah Teknologi Informasi, 11(1), 32. https://doi.org/10.24843/LKJITI.2020.v11.i01.p04
Duque, J. (2024). Data Mining for Knowledge Management. Procedia Computer Science, 239, 257–264. https://doi.org/10.1016/j.procs.2024.06.170
Dwivedi, S., & Bhaiya, L. K. P. (2019). A Systematic Review on K-Means Clustering Techniques. International Journal of Scientific Research, 5(3).
Ezugwu, A. E., Shukla, A. K., Agbaje, M. B., Oyelade, O. N., José-García, A., & Agushaka, J. O. (2021). Automatic clustering algorithms: A systematic review and bibliometric analysis of relevant literature. Neural Computing and Applications, 33(11), 6247–6306. https://doi.org/10.1007/s00521-020-05395-4
Fadhilah, R., Matdoan, M. Y., Safira, D. A., & Tahalea, S. (2024). Clustering Shrimp Distribution In Indonesia Using The X-Means Clustering Algorithm. VARIANCE: Journal of Statistics and Its Applications, 6(1), 49–54. https://doi.org/10.30598/variancevol6iss1page49-54
Ghufron, Surarso, B., & Gernowo, R. (2020). Implementation of K-Medoids Clustering for High Education Accreditation Data. Jurnal Ilmiah KURSOR, 10(3), 119–128.
Gomes, M. A., & Meisen, T. (2023). A review on customer segmentation methods for personalized customer targeting in e-commerce use cases. Information Systems and E-Business Management, 21(3), 527–570. https://doi.org/10.1007/s10257-023-00640-4
Guerola-Navarro, V., Gil-Gomez, H., Oltra-Badenes, R., & Soto-Acosta, P. (2024). Customer relationship management and its impact on entrepreneurial marketing: A literature review. International Entrepreneurship and Management Journal, 20(2), 507–547. https://doi.org/10.1007/s11365-022-00800-x
Henderi, H. (2021). Comparison of Min-Max normalization and Z-Score Normalization in the K-nearest neighbor (kNN) Algorithm to Test the Accuracy of Types of Breast Cancer. IJIIS: International Journal of Informatics and Information Systems, 4(1), 13–20. https://doi.org/10.47738/ijiis.v4i1.73
Hutagalung, J., Syahril, M., & Sobirin, S. (2022). Implementation of K-Medoids Clustering Method for Indihome Service Package Market Segmentation. Journal of Computer Networks, Architecture and High Performance Computing, 4(2), 137–147. https://doi.org/10.47709/cnahpc.v4i2.1458
Khan, R. H., Dofadar, D. F., & Rabiul Alam, Md. G. (2021). Explainable Customer Segmentation Using K-means Clustering. 2021 IEEE 12th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON), 0639–0643. https://doi.org/10.1109/UEMCON53757.2021.9666609
Mufarroha, F. A., Suzanti, I. O., Satoto, B. D., Syarif, M., & Yunita, I. (2022). K-means and k-medoids clustering methods for customer segmentation in online retail datasets. 2022 IEEE 8th Information Technology International Seminar (ITIS), 223–228. https://doi.org/10.1109/ITIS57155.2022.10010135
Mughnyanti, M., Efendi, S., & Zarlis, M. (2020). Analysis of determining centroid clustering x-means algorithm with davies-bouldin index evaluation. IOP Conference Series: Materials Science and Engineering, 725(1), 012128. https://doi.org/10.1088/1757-899X/725/1/012128
Nugroho, B. I., Rafhina, A., Ananda, P. S., & Gunawan, G. (2024). Customer segmentation in sales transaction data using k-means clustering algorithm. Journal of Intelligent Decision Support System (IDSS), 7(2), 130–136. https://doi.org/10.35335/idss.v7i2.236
Raju, V. N. G., Lakshmi, K. P., Jain, V. M., Kalidindi, A., & Padma, V. (2020). Study the Influence of Normalization/Transformation process on the Accuracy of Supervised Classification. 2020 Third International Conference on Smart Systems and Inventive Technology (ICSSIT), 729–735. https://doi.org/10.1109/ICSSIT48917.2020.9214160
Santoso, H., & Magdalena, H. (2020). Improved K-Means Algorithm on Home Industry Data Clustering in the Province of Bangka Belitung. 2020 International Conference on Smart Technology and Applications (ICoSTA), 1–6. https://doi.org/10.1109/ICoSTA48221.2020.1570598913
Saragih, R., Irawan, E., & Syahputra, I. (2021). Implementation Of K-Medoids Algorithm in Grouping Diseases in The Community. Jurnal Teknik Komputer Network, 1(1), 1–8.
Setiawati, E., Fernanda, U. D., Agesti, S., Iqbal, M., & Herjho, M. O. A. (2024). Implementation of K-Means, K-Medoid and DBSCAN Algorithms In Obesity Data Clustering. IJATIS: Indonesian Journal of Applied Technology and Innovation Science, 1(1), 23–29. https://doi.org/10.57152/ijatis.v1i1.1109
Stiadi, M. J., & Sundani, D. (n.d.). Performance Measurement of K-Means Clustering Algorithm Using Davies Bouldin Index Method. 6(4).
Suprianto, A., Sari, H. L., & Zulfiandry, R. (2023). Perbandingan Algoritma K-Means Dan K-Medoid Dalam Pengelompokan Data Pasien Berdasarkan Rekam Medis di Puskesmas M. Thaha Bengkulu Selatan. Journal of Science and Social Research, VI(3), 580–586.
Tattersall, M. (2021). Knowledge Mining Methods based on Data Warehouse: A Case Study. International Journal of Hybrid Innovation Technologies, 1(1), 1–14. https://doi.org/10.21742/ijhit.2021.1.1.01
Utomo, W. (2021). The comparison of k-means and k-medoids algorithms for clustering the spread of the covid-19 outbreak in Indonesia. ILKOM Jurnal Ilmiah, 13(1), 31–35. https://doi.org/10.33096/ilkom.v13i1.763.31-35
Wahyudi, E., Meidelfi, D., & Saam, Z. (2023). The Implementation of the K-Medoid Clustering for Grouping Hearing Loss Function on Excessive Smartphone Use. JOIV : Int. J. Inform. Visualization, 7(4), 2523–2531.
Wegmann, M., Zipperling, D., Hillenbrand, J., & Fleischer, J. (2021). A review of systematic selection of clustering algorithms and their evaluation. ArXiv, Abs/2106.12792.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Rachmad Fitriyanto, Ummi Syafiqoh
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The copyright of any article in the TECHNO Nusa Mandiri Journal is fully held by the author under the Creative Commons CC BY-NC license. The copyright in each article belongs to the author. Authors retain all their rights to published works, not limited to the rights set out on this page. The author acknowledges that Techno Nusa Mandiri: Journal of Computing and Information Technology (TECHNO Nusa Mandiri) is the first to publish with a Creative Commons Attribution 4.0 International license (CC BY-NC). Authors can enter articles separately, manage non-exclusive distribution, from manuscripts that have been published in this journal into another version (for example: sent to author affiliation respository, publication into books, etc.), by acknowledging that the manuscript was published for the first time in Techno Nusa Mandiri: Journal of Computing and Information Technology (TECHNO Nusa Mandiri); The author guarantees that the original article, written by the stated author, has never been published before, does not contain any statements that violate the law, does not violate the rights of others, is subject to the copyright which is exclusively held by the author. If an article was prepared jointly by more than one author, each author submitting the manuscript warrants that he has been authorized by all co-authors to agree to copyright and license notices (agreements) on their behalf, and agrees to notify the co-authors of the terms of this policy. Techno Nusa Mandiri: Journal of Computing and Information Technology (TECHNO Nusa Mandiri) will not be held responsible for anything that may have occurred due to the author's internal disputes.
