KOMPARASI METODE CLUSTERING K-MEANS, K-MEDOIDS, FUZZY C-MEANS, DAN DBSCAN UNTUK SEGMENTASI PELANGGAN E-COMMERCE

Authors

  • Rohman Saputra Teknik Informatika, Fakultas Teknik, Universitas Krisnadwipayana
  • Risanto Darmawan Teknik Informatika, Fakultas Teknik, Universitas Krisnadwipayana
  • Junaidi Program Studi Teknik Informatika, Fakultas Teknik, Universitas Krisnadwipayana

DOI:

https://doi.org/10.35316/jimi.v11i2.10843

Keywords:

Customer Segmentation;, E-Commerce;, RFM;, Clustering;, K-Means;

Abstract

The rapid growth of e-commerce generates large volumes of customer transaction data that can be utilized to support data-driven marketing strategies. However, this transaction data needs to be processed properly to produce meaningful information through customer segmentation. This study aims to compare the performance of K-Means, K-Medoids, Fuzzy C-Means, and DBSCAN clustering methods in segmenting e-commerce customers based on RFM (Recency, Frequency, Monetary) features. The evaluation was conducted using three metrics: Silhouette Score, Davies-Bouldin Index (DBI), and Calinski-Harabasz Index (CHI). The results show that K-Means achieved a Silhouette Score of 0.369997, a DBI of 0.919935, and a CHI of 38,226.138. While K-Medoids achieved the best DBI value of 0.914247, K-Means was considered the overall most optimal method due to its superiority in both Silhouette Score and CHI. The customer segmentation results successfully identified several distinct groups, including active and high-value customers, passive or at-risk customers, and new or regular customers. Therefore, RFM-based clustering methods can effectively help businesses understand customer characteristics to support more targeted marketing strategie .

Downloads

Download data is not yet available.

References

[1] M. Alves and G. Tobias, for personalized customer targeting in e commerce use cases, vol. 21, no. 3. Springer Berlin Heidelberg, 2023. doi: 10.1007/s10257-023-00640-4.

[2] S. Anwar and E. Iskandar, “Comparison Of Clustering Algorithms In Analyzing E-Commerce Data From Kaggle,” International Journal of Social Research, vol. 4, no. 1, pp. 38–52, Feb. 2026, doi: 10.59888/INSIGHT.V4I1.105.

[3] O. Akande, E. O. Asani, and B. Dautare, “Customer Segmentation Through RFM Analysis and K-Means Clustering: Leveraging Data-Driven Insights for Effective Marketing Strategy,” Ceddi Journal of Information System and Technology (JST), vol. 3, no. 1, pp. 14–25, Apr. 2024, doi: 10.56134/JST.V3I1.81.

[4] R. M. Fauzan and G. Alfian, “Segmentasi Pelanggan E-Commerce Menggunakan Fitur Recency, Frequency, Monetary (RFM) dan Algoritma Klasterisasi K-Means,” JISKA (Jurnal Informatika Sunan Kalijaga), vol. 9, no. 3, pp. 170–177, Sep. 2024, doi: 10.14421/JISKA.2024.9.3.170-177.

[5] C. G. Wong, G. K. Tong, and S. C. Haw, “Exploring Customer Segmentation in E-Commerce using RFM Analysis with Clustering Techniques,” Journal of Telecommunications and the Digital Economy, vol. 12, no. 3, pp. 97–125, Sep. 2024, doi: 10.18080/JTDE.V12N3.978.

[6] P. Vijay Vade, “Comparative analysis of clustering algorithms for customer segmentation and improved marketing strategies,” 2024. Accessed: Oct. 30, 2026. [Online]. Available: https://hdl.handle.net/10788/4566

[7] A. Nowak-Brzezińska and I. Gaibei, “How the Outliers Influence the Quality of Clustering?,” Entropy, vol. 24, no. 7, Jul. 2022, doi: 10.3390/E24070917.

[8] B. N. Yulisasih, B. N. Yulisasih, H. Herman, S. Sunardi, and H. Yuliansyah, “Evaluation of K-Means Clustering Using Silhouette Score Method on Customer Segmentation,” ILKOM Jurnal Ilmiah, vol. 16, no. 3, pp. 330–342, Dec. 2024, doi: 10.33096/ilkom.v16i3.2325.330-342.

[9] B. A. Pimentel, R. De Amorim Silva, and J. C. S. Costa, “Fuzzy C-Means Clustering Algorithms with Weighted Membership and Distance,” International Journal of Uncertainty, Fuzziness and Knowldege-Based Systems, vol. 30, no. 4, pp. 567–594, Aug. 2022, doi: 10.1142/S0218488522500143.

[10] M. V. Rajesh, S. R. Chintalapudi, and M. H. M. K. Prasad, “A Comparative Analysis of RFM-based Customer Segmentation with K-Means and BIRCH Clustering Techniques,” pp. 977–989, 2024, doi: 10.2991/978-94-6463-471-6_94.

[11] J. Heidari, N. Daneshpour, and A. Zangeneh, “A novel K-means and K-medoids algorithms for clustering non-spherical-shape clusters non-sensitive to outliers,” Pattern Recognit., vol. 155, Nov. 2024, doi: 10.1016/J.PATCOG.2024.110639.

[12] A. M. Ikotun, A. E. Ezugwu, L. Abualigah, B. Abuhaija, and J. Heming, “K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data,” Inf. Sci. (N. Y)., vol. 622, pp. 178–210, Apr. 2023, doi: 10.1016/J.INS.2022.11.139.

[13] A. Sundari, I. S. Putra, and N. Sibuea, “Application of The RFM Model and K-Means Clustering for Customer Segmentation in E-Wallet Top-Up Services,” Infomatek, vol. 28, no. 1, pp. 203–210, May 2026, doi: 10.23969/INFOMATEK.V28I1.42246.

[14] N. F. Fahrudin and R. Rindiyani, “Comparison of K-Medoids and K-Means Algorithms in Segmenting Customers based on RFM Criteria,” E3S Web of Conferences, vol. 484, Feb. 2024, doi: 10.1051/E3SCONF/202448402008.

[15] K. Tabianan, S. Velu, and V. Ravi, “K-Means Clustering Approach for Intelligent Customer Segmentation Using Customer Purchase Behavior Data,” Sustainability 2022, Vol. 14, Page 7243, vol. 14, no. 12, p. 7243, Jun. 2022, doi: 10.3390/SU14127243.

[16] V. Plotnikova, M. Dumas, and F. Milani, “Adaptations of data mining methodologies: A systematic literature review,” PeerJ Comput. Sci., vol. 6, pp. 1–43, May 2020, doi: 10.7717/PEERJ-CS.267/SUPP-2.

[17] A. Vouros, S. Langdell, M. Croucher, and E. Vasilaki, “An empirical comparison between stochastic and deterministic centroid initialisation for K-means variations,” Machine Learning 2021 110:8, vol. 110, no. 8, pp. 1975–2003, Jul. 2021, doi: 10.1007/S10994-021-06021-7.

[18] S. Harris and R. C. De Amorim, “An Extensive Empirical Comparison of k-means Initialization Algorithms,” IEEE Access, vol. 10, pp. 58752–58768, 2022, doi: 10.1109/ACCESS.2022.3179803.

[19] Z. Wu, L. Jin, J. Zhao, L. Jing, and L. Chen, “Research on Segmenting E-Commerce Customer through an Improved K-Medoids Clustering Algorithm,” Comput. Intell. Neurosci., vol. 2022, no. 1, p. 9930613, Jan. 2022, doi: 10.1155/2022/9930613.

[20] M. B. Ferraro, “Fuzzy k-Means: history and applications,” Econom. Stat., vol. 30, pp. 110–123, Apr. 2024, doi: 10.1016/J.ECOSTA.2021.11.008.

[21] R. J. G. B. Campello, P. Kröger, J. Sander, and A. Zimek, “Density-based clustering,” Wiley Interdiscip. Rev. Data Min. Knowl. Discov., vol. 10, no. 2, p. e1343, Mar. 2020, doi: 10.1002/WIDM.1343;REQUESTEDJOURNAL:JOURNAL:19424795;PAGEGROUP:STRING:PUBLICATION.

[22] C. Shi, B. Wei, S. Wei, W. Wang, H. Liu, and J. Liu, “A quantitative discriminant method of elbow point for the optimal number of clusters in clustering algorithm,” EURASIP Journal on Wireless Communications and Networking 2021 2021:1, vol. 2021, no. 1, pp. 31-, Feb. 2021, doi: 10.1186/S13638-021-01910-W.

[23] A. M. Bagirov, R. M. Aliguliyev, and N. Sultanova, “Finding compact and well-separated clusters: Clustering using silhouette coefficients,” Pattern Recognit., vol. 135, p. 109144, Mar. 2023, doi: 10.1016/J.PATCOG.2022.109144.

[24] M. Gagolewski, M. Bartoszuk, and A. Cena, “Are cluster validity measures (in) valid?,” Inf. Sci. (N. Y)., vol. 581, pp. 620–636, Dec. 2021, doi: 10.1016/J.INS.2021.10.004.

[25] B. Mardhotillah, A. Fadli, E. Elisa, and Z. Zurweni, “Indeks Calinski Harabasz Analisis Fuzzy C Means dan K Means Cluster Kabupaten/Kota di Provinsi Jambi Menurut Potensi Pertambangan, Penggalian, Pengadaan Listrik, dan Gas,” vol. 2, no. 1, pp. 16–22, Jun. 2023, doi: 10.22437/MULTIPROXIMITY.V2I1.25693.

Published

15-11-2026

How to Cite

Saputra, R., Darmawan, R., & Junaidi. (2026). KOMPARASI METODE CLUSTERING K-MEANS, K-MEDOIDS, FUZZY C-MEANS, DAN DBSCAN UNTUK SEGMENTASI PELANGGAN E-COMMERCE. Jurnal Ilmiah Informatika, 11(2), 200–210. https://doi.org/10.35316/jimi.v11i2.10843