Optimization of Customer Segmentation in the Retail Industry Using the K-Medoid Algorithm
The retail industry faces significant challenges in understanding increasingly complex customer behavior due to massive data growth. One major obstacle is suboptimal customer segmentation, leading to ineffective marketing strategies. This study aims to optimize customer segmentation by implementing...
Uloženo v:
| Vydáno v: | MALCOM: Indonesian Journal of Machine Learning and Computer Science Ročník 5; číslo 3; s. 766 - 775 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
19.06.2025
|
| ISSN: | 2797-2313, 2775-8575 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The retail industry faces significant challenges in understanding increasingly complex customer behavior due to massive data growth. One major obstacle is suboptimal customer segmentation, leading to ineffective marketing strategies. This study aims to optimize customer segmentation by implementing the K-Medoid algorithm, which excels in handling outliers and producing more stable clusters compared to K-Means. The dataset consists of over 10,000 customer transactions from a major retail company in Indonesia. The research process includes data collection and preprocessing, K-Medoid algorithm implementation, and performance evaluation using the silhouette score. The results indicate that the K-Medoid algorithm achieves more accurate customer segmentation, with a silhouette score of 0.39. The generated clusters exhibit greater homogeneity, enabling companies to design more targeted marketing strategies, such as specific discount offers and tailored loyalty programs. Based on these findings, the K-Medoid algorithm is recommended to enhance customer management effectiveness in the retail industry. This study contributes to selecting a more suitable algorithm for customer segmentation in the era of big data and opens opportunities for further exploration of hybrid algorithms and additional evaluation metrics. |
|---|---|
| ISSN: | 2797-2313 2775-8575 |
| DOI: | 10.57152/malcom.v5i3.1977 |