Segmentasi Pelanggan E-Commerce Berbasis Perilaku Belanja Menggunakan Algoritma K-Means Clustering dan Evaluasi Silhouette Score
Abstract
Dalam era persaingan E-Commerce yang ketat, pemahaman mendalam mengenai perilaku konsumen menjadi kunci utama keberhasilan strategi pemasaran. Penelitian ini bertujuan untuk melakukan segmentasi pelanggan toko online menggunakan algoritma K-Means Clustering berbasis perilaku belanja. Menggunakan dataset Mall Customer Segmentation, penelitian ini memproses fitur utama berupa Pendapatan Tahunan dan Skor Pengeluaran yang dinormalisasi. Evaluasi model dilakukan menggunakan metode Elbow dan Silhouette Score untuk menentukan jumlah kelompok optimal. Hasil penelitian menunjukkan bahwa pembagian pelanggan menjadi 5 cluster adalah yang paling optimal dengan nilai Silhouette Score sebesar 0.5547. Kelima segmen yang terbentuk meliputi Middle Class (40,5%), VIP/Big Spenders (19,5%), Hemat Mapan (17,5%), Ekonomis (11,5%), dan Impulsif (11%). Temuan ini memberikan wawasan strategis bagi pelaku bisnis untuk merancang kampanye pemasaran yang terpersonalisasi, seperti program loyalitas eksklusif untuk segmen VIP dan penawaran diskon intensif untuk segmen Ekonomis, guna meningkatkan retensi dan profitabilitas
References
L. Wang, T. R. A. L. Pertheban, T. Li, and L. Zhao, “Application of business intelligence based on big data in E-commerce data evaluation,” Heliyon, vol. 10, no. 21, p. e38768, 2024.
V. M. Reddy and L. N. Nalla, “Leveraging Big Data Analytics to Enhance Customer Experience in E-commerce,” Rev. Esp. Doc. Cient., vol. 18, no. 02, pp. 295–324, 2024.
J. M. John, O. Shobayo, and B. Ogunleye, “An Exploration of Clustering Algorithms for Customer Segmentation in the UK Retail Market,” Analytics, vol. 2, no. 4, pp. 1–16, 2023, doi: 10.3390/analytics2040042.
W. Liang, Y. Zhang, M. Codreanu, J. Wang, H. Cao, and J. Zou, “The widespread adoption of large language model-assisted writing across society,” Patterns, vol. 6, no. 12, pp. 1–23, 2025, doi: 10.1016/j.patter.2025.101366.
A. Y. N. Rumapea, D. Pratiwi, and S. Sari, “Analisis segmentasi pelanggan ritel online menggunakan K-Means clustering berdasarkan model Recency, Frequency, Monetary (RFM),” J. Sains dan Teknol., vol. 6, no. 3, pp. 292–299, 2024.
K. Tabianan, S. Velu, and V. Ravi, “K-Means Clustering Approach for Intelligent Customer Segmentation Using Customer Purchase Behavior Data,” Sustainability, vol. 14, no. 12, p. 7243, 2022, doi: 10.3390/su14127243.
A. Putera, U. Siahaan, N. A. Harahap, and R. Y. Simanullang, “Analysis of Inpatient Data Using Cluster Analysis on Simulation Dataset,” J. BIT (Bulletin Inf. Technol., vol. 6, no. 1, pp. 33–39, 2025, doi: 10.47065/bit.v5i2.1830.
L. Erlistya, P. S. Sumarna, and ..., “Implementasi Algoritma K-Means Clustering pada Studi Kasus Seleksi Mahasiswa Berprestasi menggunakan Visual Basic,” Pros. Semin. …, vol. 4, no. 2721, 2021.
M. R. P. Pratama et al., “Perbandingan Algoritma K-Means, K-Medoid, dan Dbscan Untuk Clustering Kualitas Hidup Indonesia Dalam Perspektif Knowledge Management Dan Data Discovery,” JATI (Jurnal Mhs. Tek. Inform., vol. 9, no. 4, pp. 5903–5910, 2025, doi: 10.36040/jati.v9i4.13916.
R. Y. Simanullang, P. Wanny, and S. M. Rambe, “Implementation of the K-Means Algorithm on Smart Systems in Grouping Gadget Accessory Purchase Patterns,” JITCSE (Journal Inf. Technol. Komput. Sci. Electr. Eng., vol. 2, no. 3, pp. 22–31, 2026, doi: 0.61306/jitcse.
A. L. M. Tampubolon, T. M. E. Y. B. Butar, and S. Rochimah, “Segmentasi Pelanggan Majalah Pada Situs Web E-Commerce Segmentation of Magazine Subscribers On E-Commerce Website using K-Means ++ and RFM Method,” J. Teknol. Inf. dan ilmu Komput., vol. 11, no. 6, pp. 1243–1252, 2024, doi: 10.25126/jtiik.2024118208.
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, 2022, doi: 10.1155/2022/9930613.
I. L. Pratama et al., “Pemodelan RFM & K-Means Clusteringuntuk Segmentasi Pelanggan dalam Penjualan Online,” J. Softw. Eng. Inf. Syst., vol. 5, no. 2, pp. 49–58, 2025, doi: 10.37859/seis.v5i2.9556.
V. S. Kirubakaran and S. G, “Customer Segmentation using Clustering Techniques: Data-Driven Approach to Enhance Marketing Strategy,” in 2024 International Conference on Sustainable Communication Networks and Application (ICSCNA), 2024, pp. 1–6. doi: 10.1109/ICSCNA63714.2024.10864053.
Y. Putri, D. Aldo, and W. Ilham, “Retail Marketing Strategy Optimization: Customer Segmentation with Artificial Intelligence Integration and K-Means Clustering,” Sink. J. dan Penelit. Tek. Inform., vol. 8, no. 1, pp. 20–28, 2024, doi: 10.33395/sinkron.v8i4.14000.
M. Risnasari, N. Aulia, and L. Cahyani, “Clustering Of Student Learning Styles in the Industry 4 . 0 Using KMeans Algorithm,” J. Bina Komput., vol. 24, no. August, pp. 246–257, 2022.
A. K. E. Pily and U. Rio, “Komparasi K-Means Clustering dengan Euclidean dan Cosine Similarity untuk Segmentasi dan Rekomendasi Produk pada Data E-Commerce,” Indones. J. Comput. Sci., vol. 14, no. 2, 2025, doi: 10.33022/ijcs.v14i2.4713.
R. D. Nugraha, D. D. Adelia, and D. Rivaldi, “Segmentasi Pelanggan Retail Berbasis Perilaku menggunakan Algoritma K-Means Clustering,” Digit. Transform. Technol., vol. 5, no. 2, pp. 141–148, 2025, doi: 10.47709/digitech.v5i2.6340.
A. Ghosh Chowdhury, R. Deora, R. Prathikantam, and S. Kumar, “Dynamic Clustering with Deep Learning for Customer Segmentation,” in 2025 7th International Conference on Intelligent Sustainable Systems (ICISS), 2025, pp. 450–456. doi: 10.1109/ICISS63372.2025.11076506.
Z. Lei, “Advances in Regression and Classification Models for Customer Data Analysis in Retail Enterprises: A Comprehensive Review,” Adv. Econ. Manag. Res., vol. 15, no. 1, pp. 200–210, 2025, doi: 10.56028/aemr.15.1.750.2025.
Copyright (c) 2026 Muhammad Yusran, Rizkah Fadillah, Mesran

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).


