Perbandingan Kinerja Algoritma K-means dan Agglomerative Clustering  Untuk Segmentasi Penjualan Online Pada Customer Retail

Ghanim Ramadhan; Yuli Astuti

doi:10.30591/jpit.v9i1.5735

Perbandingan Kinerja Algoritma K-means dan Agglomerative Clustering Untuk Segmentasi Penjualan Online Pada Customer Retail

Ghanim Ramadhan, Yuli Astuti

Abstract

This research focuses on the comparison between two popular algorithms in data science, namely K-means and Agglomerative Clustering algorithms. The main context of this research is customer data segmentation, a very important process in the business world to understand and serve customers better. The main objective of this research is to evaluate and compare the performance of the two algorithms in generating effective and efficient customer segments. In this research, the dataset used is a retail customer dataset. This dataset includes various attributes that reflect customer characteristics and behavior. To measure the performance of both algorithms, this research uses the RFM (Recency, Frequency, Monetary) weighting method. This method is a commonly used method in customer analysis to identify the most valuable customers based on how recently they transacted (Recency), how often they transact (Frequency), and how much their transactions are worth (Monetary). In addition, this research also uses an evaluation metric known as silhouette score. This metric is used to measure how well an object fits into its own cluster compared to other clusters. The results of this study provide valuable insights into the quality of both algorithms in segmenting customer data. It was found that the K-Means algorithm produced a silhouette score value of 0.5087, while Agglomerative Clustering produced a higher value of 0.6363. This suggests that, in the context of this dataset, Agglomerative Clustering may be more effective compared to K-Means. However, further research is certainly needed to validate these findings and to further explore how these two algorithms can be optimized for customer data segmentation

Keywords

Analisis algoritma, K-means, Agglomerative Clustering, RFM, Silhouette Score

Full Text:

References

W. Widyawati, W. L. Y. Saptomo, and Y. R. W. Utami, “Penerapan Agglomerative Hierarchical Clustering Untuk Segmentasi Pelanggan,” J. Ilm. SINUS, vol. 18, no. 1, p. 75, Jan. 2020, doi: 10.30646/sinus.v18i1.448.

K. B, “A Comparative Study on K-Means Clustering and Agglomerative Hierarchical Clustering,” Int. J. Emerg. Trends Eng. Res., vol. 8, no. 5, pp. 1600–1604, 2020, doi: 10.30534/ijeter/2020/20852020.

N. K. Zuhal, “Study Comparison K-Means Clustering dengan Algoritma Hierarchical Clustering,” Pros. Semin. Nas. Teknol. dan Sains, vol. 1, pp. 200–205, 2022, [Online]. Available: https://jurnal.dharmawangsa.ac.id/index.php/djtechno/article/view/966/867

R. P. Justitia, N. Hidayat, and E. Santoso, “Implementasi Metode Agglomerative Hierarchical Clustering Pada Segmentasi Pelanggan Barbershop (Studi Kasus : RichDjoe Barbershop Malang),” 2021. [Online]. Available: http://j-ptiik.ub.ac.id

Ş. Ozan, “A Case Study on Customer Segmentation by using Machine Learning Methods,” 2018 Int. Conf. Artif. Intell. Data Process. IDAP 2018, pp. 0–5, 2019, doi: 10.1109/IDAP.2018.8620892.

A. G. Aggarwal and S. Yadav, “Customer Segmentation Using Fuzzy-AHP and RFM Model,” ICRITO 2020 - IEEE 8th Int. Conf. Reliab. Infocom Technol. Optim. (Trends Futur. Dir., pp. 77–80, 2020, doi: 10.1109/ICRITO48877.2020.9197903.

P. P. Pramono, I. Surjandari, and E. Laoh, “Estimating customer segmentation based on customer lifetime value using two-stage clustering method,” 2019 16th Int. Conf. Serv. Syst. Serv. Manag. ICSSSM 2019, no. 1994, pp. 1–5, 2019, doi: 10.1109/ICSSSM.2019.8887704.

B. G. Muchardie, A. Gunawan, and B. Aditya, “E-Commerce Market Segmentation Based on the Antecedents of Customer Satisfaction and Customer Retention,” Proc. 2019 Int. Conf. Inf. Manag. Technol. ICIMTech 2019, vol. 1, no. August, pp. 103–108, 2019, doi: 10.1109/ICIMTech.2019.8843792.

K. Torizuka, H. Oi, F. Saitoh, and S. Ishizu, “Benefit Segmentation of Online Customer Reviews Using Random Forest,” IEEE Int. Conf. Ind. Eng. Eng. Manag., vol. 2019-December, pp. 487–491, 2019, doi: 10.1109/IEEM.2018.8607697.

Y. Parikh and E. Abdelfattah, “Clustering Algorithms and RFM Analysis Performed on Retail Transactions,” 2020 11th IEEE Annu. Ubiquitous Comput. Electron. Mob. Commun. Conf. UEMCON 2020, pp. 0506–0511, 2020, doi: 10.1109/UEMCON51285.2020.9298123.

S. S. Chikkond, R. Salagar, and S. S. Veni, “Segmentation Of Document Images Using Different Methods Like K-Mean Clustering And Fuzzy Clustering,” in 2021 International Conference on Computer Communication and Informatics (ICCCI), Jan. 2021, pp. 1–6. doi: 10.1109/ICCCI50826.2021.9402546.

A. Nugraha, M. Arista Harum Perdana, H. Agus Santoso, J. Zeniarja, A. Luthfiarta, and A. Pertiwi, “Determining the Senior High School Major Using Agglomerative Hierarchial Clustering Algorithm,” Proc. - 2018 Int. Semin. Appl. Technol. Inf. Commun. Creat. Technol. Hum. Life, iSemantic 2018, pp. 225–228, 2018, doi: 10.1109/ISEMANTIC.2018.8549834.

Kristiana, K. R. Sungkono, and R. Sarno, “Determine Types of Indonesian Hospital by Criteria-based Proses Model, K-means Cluster, and Hierarchical Average Linkage,” Proc. - 2019 Int. Semin. Appl. Technol. Inf. Commun. Ind. 4.0 Retrosp. Prospect. Challenges, iSemantic 2019, pp. 191–195, 2019, doi: 10.1109/ISEMANTIC.2019.8884299.

H. Yin, Z. Wang, P. Liu, Z. Zhang, and Y. Li, “Voltage Fault Diagnosis of Power Batteries based on Boxplots and Gini Impurity for Electric Vehicles,” 2019 Electr. Veh. Int. Conf. EV 2019, pp. 1–5, 2019, doi: 10.1109/EV.2019.8892849.

K. Patil, N. K. Nagwani, and S. Tripathi, “A Parametric Study of Partitioning and Density Based Clustering Techniques for Boxplot Generation,” 2018 3rd Int. Conf. Converg. Technol. I2CT 2018, pp. 1–5, 2018, doi: 10.1109/I2CT.2018.8529468.

K. R. Shahapure and C. Nicholas, “Cluster quality analysis using silhouette score,” Proc. - 2020 IEEE 7th Int. Conf. Data Sci. Adv. Anal. DSAA 2020, pp. 747–748, 2020, doi: 10.1109/DSAA49011.2020.00096.

DOI: https://doi.org/10.30591/jpit.v9i1.5735