Publisher

IRPIIRPI

Journal MALCOM: Indonesian Journal of Machine Learning and Computer ScienceMALCOM: Indonesian Journal of Machine Learning and Computer Science Abstract

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.

Conclusion

This study successfully applied the K-Medoid algorithm to segment customers in the retail industry, revealing distinct groups based on transaction behavior.The results demonstrate the algorithms ability to generate more accurate and stable customer segments compared to other methods.These findings provide valuable insights for retailers to develop targeted marketing strategies and improve customer management effectiveness.

Future Research

Further research should investigate the integration of the K-Medoid algorithm with other machine learning techniques, such as deep learning, to enhance the accuracy and predictive power of customer segmentation. Additionally, exploring the use of alternative evaluation metrics beyond the Silhouette Score, such as the Calinski-Harabasz Index or Davies-Bouldin Index, could provide a more comprehensive assessment of clustering performance. Finally, future studies could focus on incorporating demographic and psychographic data alongside transactional data to create more nuanced and actionable customer segments, allowing for highly personalized marketing campaigns and improved customer relationship management. These investigations will contribute to a deeper understanding of customer behavior and enable retailers to optimize their strategies for increased profitability and customer satisfaction.

References

1. Penerapan Algoritma K-Medoids dan FP-Growth dengan Model RFM untuk Kombinasi Produk | Building of Informatics,... ejurnal.seminar-id.com/index.php/bits/article/view/5268Penerapan Algoritma K Medoids dan FP Growth dengan Model RFM untuk Kombinasi Produk Building of Informatics ejurnal seminar id index php bits article view 5268
2. Comparison of Support Vector Machine and XGBSVM in Analyzing Public Opinion on Covid-19 Vaccination |... jurnal.fikom.umi.ac.id/index.php/ILKOM/article/view/1090Comparison of Support Vector Machine and XGBSVM in Analyzing Public Opinion on Covid 19 Vaccination jurnal fikom umi ac index php ILKOM article view 1090
3. Penerapan Algoritma K-Medoids Untuk Menentukan Segmentasi Pelanggan | Sulistyawati | Sistemasi: Jurnal... doi.org/10.32520/stmsi.v10i3.1332Penerapan Algoritma K Medoids Untuk Menentukan Segmentasi Pelanggan Sulistyawati Sistemasi Jurnal doi 10 32520 stmsi v10i3 1332

Subjects

1. #gaya hidup sehat#gaya hidup sehat
2. #animasi 3d tata#animasi 3d tata

Metadata

File size	386.17 KB
Pages	10
Short Link	https://juris.id/p-Hd
Lookup Links	Google ScholarGoogle Scholar, Semantic ScholarSemantic Scholar, CORE.ac.ukCORE.ac.uk, WorldcatWorldcat, ZenodoZenodo, Research GateResearch Gate, Academia.eduAcademia.edu, OpenAlexOpenAlex, Hollis HarvardHollis Harvard
DMCA	Report