SEGMENTASI KATEGORI PRODUK BERDASARKAN RESPONSIVITAS PROMOSI PADA BISNIS FASHION RETAIL MENGGUNAKAN AGGLOMERATIVE HIERARCHICAL CLUSTERING

Authors

  • Wahiddin Ishak Magister Ilmu Komputer, Universitas Budi Luhur
  • Rusdah Rusdah Magister Ilmu Komputer, Universitas Budi Luhur

DOI:

https://doi.org/10.36080/skanika.v9i2.3926

Keywords:

agglomerative hierarchical clustering, fashion retail, product segmentation, promotional responsiveness, Ward's linkage

Abstract

Fashion retail companies often repeat identical promotion types without proportional sales gains because no empirical mapping shows which product categories respond to which promotional mechanisms. This study segments product categories by promotional responsiveness using Agglomerative Hierarchical Clustering (AHC) with Ward's Linkage. The data comprise 103.9 million sales transaction rows from 2023 at PT Matahari Department Store, Tbk., which, after cleaning, department-level aggregation, label encoding, and Min-Max normalization, yielded 6,089 records covering 790 departments, 14 promotion names, and six promotion periods specific to the Indonesian market. We determined the optimal number of clusters using the Silhouette Coefficient, Davies-Bouldin Index, and SSE reduction, and cross-validated it against the merge-distance jump in the dendrogram. Ward's Linkage consistently outperformed Average Linkage across all tested values of k, with the best configuration at four clusters (Silhouette 0.474; DBI 0.049). The four clusters exhibit sharply different responsiveness: one cluster of 317 departments contributes 99.11% of promotion-related units sold with a PromoHitRate of 0.986, while another cluster of 316 departments records no promotional sales at all. The near-uniform distribution of promotion types and periods across clusters indicates that the performance gap stems not from exposure bias but from each department's internal effectiveness. These segmentation results provide a basis for more targeted promotional budget allocation and more efficient inventory management.

Downloads

Download data is not yet available.

References

[1] PT Matahari Department Store Tbk., Annual Report 2023. Jakarta: PT Matahari Department Store Tbk., 2023.

[2] Y. Sun, R. Wang, H. Bai, et al., "Perceived values of luxury fashion brands—evidence from Indonesian Millennials," SN Business & Economics, vol. 4, art. 169, 2024, doi: 10.1007/s43546-024-00755-x.

[3] Y. W. Handranata and S. Kalila, "Attitude toward fashion influencers and its impact on purchase behavior: the roles of brand attitude and purchase intention," Frontiers in Communication, vol. 10, art. 1583602, 2025, doi: 10.3389/fcomm.2025.1583602.

[4] W. N. M. Ariffin et al., "Product Pairing Selection for Promotion using Partitioning Method," Journal of Advanced Research in Applied Sciences and Engineering Technology, vol. 30, no. 3, pp. 91–103, 2023, doi: 10.37934/araset.30.3.91103.

[5] N. Phumchusri, W. Kosawanitchakarn, S. Chawanapranee, et al., "Evaluating promotional pricing effectiveness using convenience store daily sales data," Journal of Revenue and Pricing Management, vol. 22, no. 5, pp. 362–373, 2023, doi: 10.1057/s41272-022-00415-5.

[6] C. Binsriavanich and N. Phumchusri, "An analysis of retail promotional pricing effectiveness using agent-based modeling," Journal of Revenue and Pricing Management, vol. 24, no. 1, pp. 60–79, 2025, doi: 10.1057/s41272-024-00512-7.

[7] A. Agussalim, K. P. R. Wardhani, and A. Anjani, "Sales Product Clustering Using RFM Calculation Model And K-Means Algorithm on Primskystore," Technium: Romanian Journal of Applied Sciences and Technology, vol. 16, pp. 176–182, 2023, doi: 10.47577/technium.v16i.9978.

[8] C. P. Ufeli, M. U. Sattar, R. Hasan, and S. Mahmood, "Enhancing Customer Segmentation Through Factor Analysis of Mixed Data (FAMD)-Based Approach Using K-Means and Hierarchical Clustering Algorithms," Information, vol. 16, no. 6, art. 441, 2025, doi: 10.3390/info16060441.

[9] V. Wulandari et al., "Comparison of Density-Based Spatial Clustering of Applications with Noise (DBSCAN), K-Means and X-Means Algorithms on Shopping Trends Data," IJATIS: Indonesian Journal of Applied Technology and Innovation Science, vol. 1, no. 1, pp. 1–8, 2024, doi: 10.57152/ijatis.v1i1.1135.

[10] R. M. F. Lubis et al., "Agglomerative Hierarchical Clustering (AHC) Method for Data Mining Sales Product Clustering," Building of Informatics, Technology and Science (BITS), vol. 5, no. 1, 2023, doi: 10.47065/bits.v5i1.3569.

[11] 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. 809–823, 2023, doi: 10.3390/analytics2040042.

[12] E. Febrianty, L. Awalina, and W. I. Rahayu, "Optimalisasi Strategi Pemasaran dengan Segmentasi Pelanggan Menggunakan Penerapan K-Means Clustering pada Transaksi Online Retail," Jurnal Teknologi dan Informasi (JATI), vol. 13, no. 2, 2023, doi: 10.34010/jati.v13i2.

[13] Y. Arvio, J. E. Riwurohi, and E. K. Dewantara, "Pemodelan Segmentasi Transaksi Jual Beli Produk Menggunakan Pendekatan Model K-Means dan Subtractive Clustering Studi Kasus Survey Pada Beberapa Cabang Optik Retail," PETIR, vol. 16, no. 1, pp. 39–47, 2023, doi: 10.33322/petir.v16i1.1897.

[14] R. S. Iswandaru and A. D. Indriyanti, "Sales Performance Classification of Promotional Products Using Data Mining," Journal of Emerging Information Systems and Business Intelligence (JEISBI), vol. 7, no. 2, pp. 213–220, 2026, doi: 10.26740/jeisbi.v7i2.75897.

[15] D. Sugianti et al., "Analisis Cluster Penentuan Promosi Produk Pasca Pandemi Covid-19 dengan Metode K-Means," Jurnal Manajemen Informatika & Komputerisasi Akuntansi, vol. 7, no. 1, pp. 20–24, 2023, doi: 10.46880/jmika.Vol7No1.pp20-24.

[16] I. Pii, N. Suarna, and N. Rahaningsih, "Penerapan Data Mining pada Penjualan Produk Pakaian Dameyra Fashion Menggunakan Metode K-Means Clustering," JATI (Jurnal Mahasiswa Teknik Informatika), vol. 7, no. 1, 2023, doi: 10.36040/jati.v7i1.6336.

[17] D. Bakkelund, "Order Preserving Hierarchical Agglomerative Clustering," Machine Learning, vol. 111, pp. 1851–1901, 2022, doi: 10.1007/s10994-021-06125-0.

[18] F. Martinez-Plumed et al., "CRISP-DM Twenty Years Later: From Data Mining Processes to Data Science Trajectories," IEEE Transactions on Knowledge and Data Engineering, vol. 33, no. 8, pp. 3048–3061, 2021, doi: 10.1109/TKDE.2019.2962680.

[19] D. Chicco, A. Campagner, A. Spagnolo, D. Ciucci, and G. Jurman, "The Silhouette coefficient and the Davies-Bouldin index are more informative than Dunn index, Calinski-Harabasz index, Shannon entropy, and Gap statistic for unsupervised clustering internal evaluation of two convex clusters," PeerJ Computer Science, vol. 11, art. e3309, 2025, doi: 10.7717/peerj-cs.3309.

[20] A. Anfossi and D. Chicco, "An easy guide to the Davies-Bouldin index for unsupervised internal clustering evaluation," Discover Computing, vol. 29, no. 1, art. 212, 2026, doi: 10.1007/s10791-026-10094-0.

[21] S. R. Anggraeni, "Implementasi Algoritma Clustering DBSCAN Terhadap Pola Navigasi Pengguna di Perpustakaan Digital untuk Mengungkap Zona Buta Akses Informasi dan Optimalisasi Antarmuka Sistem," SKANIKA: Sistem Komputer dan Teknik Informatika, vol. 8, no. 2, pp. 232–243, 2025, doi: 10.36080/skanika.v8i2.3524.

[22] M. Y. Wulang, S. A. Wibowo, and E. H. Susanto, "SIG dengan K-Means++ untuk Klasterisasi Pengembangan UMKM Kain Tenun (Studi Kasus: Kabupaten Nagekeo)," SKANIKA: Sistem Komputer dan Teknik Informatika, vol. 9, no. 1, pp. 47–60, 2026, doi: 10.36080/skanika.v9i1.3630.

[23] D. Krisnawati et al., "Penerapan Text Mining pada Analisis Sentimen Pengguna Twitter Layanan Transportasi Online Menggunakan Metode Density Based Spatial Clustering of Applications with Noise (DBSCAN) dan K-Means," J Statistika, vol. 15, no. 1, pp. 184–194, 2022, doi: 10.36456/jstat.vol15.no1.a5983.

Downloads

Published

2026-07-31

How to Cite

[1]
W. Ishak and R. Rusdah, “SEGMENTASI KATEGORI PRODUK BERDASARKAN RESPONSIVITAS PROMOSI PADA BISNIS FASHION RETAIL MENGGUNAKAN AGGLOMERATIVE HIERARCHICAL CLUSTERING”, SKANIKA, vol. 9, no. 2, pp. 374–384, Jul. 2026.