Evaluasi Multi-Metrik untuk Pemilihan Cluster Optimal UMKM: Komparasi K-Means dan K-Medoids
Multi-Metric Evaluation for Optimal Clustering MSMEs: K-Means and K-Medoids
DOI:
https://doi.org/10.57152/malcom.v6i4.2950Keywords:
Clustering, Evaluasi Multi Metrik, K-Means, K-Medoids, UMKMAbstract
Usaha Mikro, Kecil, dan Menengah (UMKM) memegang peranan krusial dalam menopang perekonomian Indonesia, sehingga pendekatan berbasis data menjadi kebutuhan penting untuk mendukung perumusan kebijakan pengembangan yang lebih efektif. Penelitian ini bertujuan untuk mengevaluasi dan membandingkan kinerja algoritma K-Means dan K-Medoids dalam melakukan pengelompokan data UMKM di Kabupaten Garut. Berbeda dengan sebagian besar penelitian terdahulu yang menentukan konfigurasi cluster menggunakan satu indeks validitas internal, penelitian ini mengintegrasikan tiga indeks validitas internal, yaitu Silhouette Score, Davies-Bouldin Index, dan Calinski-Harabasz Index melalui pendekatan ranking multi-metrik untuk memperoleh evaluasi konfigurasi cluster yang lebih komprehensif. Data yang digunakan bersumber dari Dinas Koperasi, UMKM, dan BMT Kabupaten Garut dan telah melalui tahap prapemrosesan. Eksperimen dilakukan pada rentang jumlah cluster k=2 hingga k=8. Hasil penelitian menunjukkan bahwa konfigurasi terbaik K-Means diperoleh pada k=6, sedangkan K-Medoids pada k=7. Pada konfigurasi optimal tersebut, K-Means secara keseluruhan menghasilkan kualitas cluster yang lebih baik dibandingkan dengan K-Medoids. Penelitian ini menunjukkan bahwa penggunaan beberapa indeks validitas internal secara terpadu dapat memberikan dasar yang lebih objektif dalam menentukan konfigurasi cluster yang optimal serta mendukung segmentasi UMKM sebagai acuan penyusunan program pembinaan yang lebih tepat sasaran.
Downloads
References
K. Indonesia, “UMKM Indonesia,” Kadin.Id. Accessed: Jun. 12, 2026. [Online]. Available: https://kadin.id/data-dan-statistik/umkm-indonesia/
A. Azzam, A. Irma Purnamasari, and I. Ali, “Implementasi Algoritma K-Means Clustering Untuk Analisis Persebaran Umkm Di Jawa Barat,” JATI (Jurnal Mhs. Tek. Inform., vol. 8, no. 3, pp. 3062–3070, 2024, doi: 10.36040/jati.v8i3.8450.
T. Tetep et al., “Potensi Pariwisata Garut Dalam Mewujudkan Ekonomi Kreatif,” Bus. Innov. Entrep. J., vol. 3, no. 02, pp. 141–146, 2021, doi: 10.35899/biej.v3i02.219.
Pemerintah Kabupaten Garut, “Rencana Pembangunan Jangka Panjang Daerah (RPJPD) Kabupaten Garut Tahun 2025-2045,” Garut, 2024. [Online]. Available: https://www.garutkab.go.id/dokumen/perencanaan
I. Rudiawan, “Tantangan UMKM, Pemkab Garut: Jangan Bergantung pada Industri Skala Besar,” RRI Bandung, Bandung, 2026. [Online]. Available: https://rri.co.id/bandung/ekonomi/bisnis/2513028/tantangan-umkm-pemkab-garut-jangan-bergantung-pada-industri-skala-besar
P. Puntoriza and C. Fibriani, “Analisis Persebaran UMKM Kota Malang Menggunakan Cluster K-means,” JOINS (Journal Inf. Syst., vol. 5, no. 1, pp. 86–94, 2020, doi: 10.33633/joins.v5i1.3469.
S. Ariska, D. Puspita, and I. Anggraini, “Comparison Of K-Means and K-Medoids Algorithm for Clustering Data UMKM in Pagar Alam City,” J. Sisfokom (Sistem Inf. dan Komputer), vol. 13, no. 2, pp. 193–199, 2024, doi: 10.32736/sisfokom.v13i2.2090.
N. Dwitiyanti, Siti Ayu Kumala, and Shinta Dwi Handayani, “Comparative Study of Earthquake Clustering in Indonesia Using K-Medoids, K-Means, DBSCAN, Fuzzy C-Means and K-AP Algorithms,” J. RESTI (Rekayasa Sist. dan Teknol. Informasi), vol. 8, no. 6, pp. 768–778, Dec. 2024, doi: 10.29207/resti.v8i6.5514.
N. T. Luchia, H. Handayani, F. S. Hamdi, D. Erlangga, and S. F. Octavia, “Perbandingan K-Means dan K-Medoids Pada Pengelompokan Data Miskin di Indonesia,” MALCOM Indones. J. Mach. Learn. Comput. Sci., vol. 2, no. 2, pp. 35–41, Sep. 2022, doi: 10.57152/malcom.v2i2.422.
H. Syukron, M. Fauzi Fayyad, F. Junita Fauzan, Y. Ikhsani, and U. Rizkya Gurning, “Perbandingan K-Means K-Medoids dan Fuzzy C-Means untuk Pengelompokan Data Pelanggan dengan Model LRFM,” MALCOM Indones. J. Mach. Learn. Comput. Sci., vol. 2, no. 2, pp. 76–83, Sep. 2022, doi: 10.57152/malcom.v2i2.442.
M. D. Salman et al., “Perbandingan Kinerja Algoritma Clustering K-Means dan K-Medoids dalam Pengelompokan Sekolah di Provinsi Riau Berdasarkan Ketersediaan Sarana dan Prasarana,” MALCOM Indones. J. Mach. Learn. Comput. Sci., vol. 5, no. 3, pp. 797–806, Jun. 2025, doi: 10.57152/malcom.v5i3.1950.
F. Murtagh and P. Contreras, “Algorithms for hierarchical clustering: an overview, II,” WIREs Data Min. Knowl. Discov., vol. 7, no. 6, pp. 1–16, Nov. 2017, doi: 10.1002/widm.1219.
O. Arbelaitz, I. Gurrutxaga, J. Muguerza, J. M. Pérez, and I. Perona, “An extensive comparative study of cluster validity indices,” Pattern Recognit., vol. 46, no. 1, pp. 243–256, Jan. 2013, doi: 10.1016/j.patcog.2012.07.021.
Pemerintah Republik Indonesia, “Peraturan Pemerintah Nomor 24 Tahun 2018 tentang Pelayanan Perizinan Berusaha Terintegrasi Secara Elektronik.” Accessed: Jun. 12, 2026. [Online]. Available: https://peraturan.bpk.go.id/Details/82994/pp-no-24-tahun-2018
L. J. Garcia-Martinez, S. Kraus, M. Breier, and A. Kallmuenzer, “Untangling the relationship between small and medium-sized enterprises and growth: a review of extant literature,” Int. Entrep. Manag. J., vol. 19, no. 2, pp. 455–479, Jun. 2023, doi: 10.1007/s11365-023-00830-z.
T. Tambunan, “Recent evidence of the development of micro, small and medium enterprises in Indonesia,” J. Glob. Entrep. Res., vol. 9, no. 1, p. 18, Dec. 2019, doi: 10.1186/s40497-018-0140-4.
J. Han, M. Kamber, and J. Pei, Data Mining. Elsevier, 2012. doi: 10.1016/C2009-0-61819-5.
C. Wongoutong, “The impact of neglecting feature scaling in k-means clustering,” PLoS One, vol. 19, no. 12, p. e0310839, Dec. 2024, doi: 10.1371/journal.pone.0310839.
L. Kaufman and P. J. Rousseeuw, Finding Groups in Data, vol. 47, no. 2. in Wiley Series in Probability and Statistics, vol. 47. Wiley, 1990. doi: 10.1002/9780470316801.
K. P. Sinaga and M.-S. Yang, “Unsupervised K-Means Clustering Algorithm,” IEEE Access, vol. 8, pp. 80716–80727, 2020, doi: 10.1109/ACCESS.2020.2988796.
E. Schubert and P. J. Rousseeuw, “Fast and eager k-medoids clustering: O(k) runtime improvement of the PAM, CLARA, and CLARANS algorithms,” Inf. Syst., vol. 101, p. 101804, Nov. 2021, doi: 10.1016/j.is.2021.101804.
D. Arthur and S. Vassilvitskii, K-means++: The advantages of careful seeding, vol. 08. 2007. doi: https://dl.acm.org/doi/10.5555/1283383.1283494.
B. A. Gultom, F. M. D. T. Tampubolon, and T. S. T. Tanjung, “K-Medoids Robustness to Outliers in Management Data,” JADEN J. Algorithmic Digit. Eng. Networks, vol. 1, no. 2, pp. 76–85, Jan. 2026, doi: 10.65853/jaden.v1i2.123.
R. Cordeiro de Amorim and V. Makarenkov, “Improving clustering quality evaluation in noisy Gaussian mixtures,” Neurocomputing, vol. 680, p. 133330, Jun. 2026, doi: 10.1016/j.neucom.2026.133330.
P. J. Rousseeuw, “Silhouettes: A graphical aid to the interpretation and validation of cluster analysis,” J. Comput. Appl. Math., vol. 20, pp. 53–65, Nov. 1987, doi: 10.1016/0377-0427(87)90125-7.
D. L. Davies and D. W. Bouldin, “A Cluster Separation Measure,” IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-1, no. 2, pp. 224–227, Apr. 1979, doi: 10.1109/TPAMI.1979.4766909.
T. Cali?ski and J. Harabasz, “A dendrite method for cluster analysis,” Commun. Stat., vol. 3, no. 1, pp. 1–27, Jan. 1974, doi: 10.1080/03610927408827101.
V. Pihur, S. Datta, and S. Datta, “Weighted rank aggregation of cluster validation measures: a Monte Carlo cross-entropy approach,” Bioinformatics, vol. 23, no. 13, pp. 1607–1615, Jul. 2007, doi: 10.1093/bioinformatics/btm158.
B. Sowan, T.-P. Hong, A. Al-Qerem, M. Alauthman, and N. Matar, “Ensembling validation indices to estimate the optimal number of clusters,” Appl. Intell., vol. 53, no. 9, pp. 9933–9957, May 2023, doi: 10.1007/s10489-022-03939-w.
S. M. Meliyana, A. S.A. Dunggio, S. Muhammad, and A. Rahman, “Comparative Performance Analysis of Two Clustering Methods for Grouping Indonesian Provinces Based on Forest Area Size,” Daengku J. Humanit. Soc. Sci. Innov., vol. 5, no. 4, pp. 573–581, Aug. 2025, doi: 10.35877/454RI.daengku4439.
R. W. Sembiring Brahmana, F. A. Mohammed, and K. Chairuang, “Customer Segmentation Based on RFM Model Using K-Means, K-Medoids, and DBSCAN Methods,” Lontar Komput. J. Ilm. Teknol. Inf., vol. 11, no. 1, p. 32, Apr. 2020, doi: 10.24843/LKJITI.2020.v11.i01.p04.
F. R. Sucahyo, I. H. Santi, M. F. Rahmat, and D. Fahrizal, “Comparing K-Means and K-medoids algorithms for clustering hamlet regions by tax liabilities in tax determination documents,” Int. J. Sci. Technol. Res. Arch., vol. 8, no. 1, pp. 069–078, Feb. 2025, doi: 10.53771/ijstra.2025.8.1.0023.
H. Mulyani, R. A. Setiawan, and H. Fathi, “Optimization of K Value in Clustering Using Silhouette Score (Case Study: Mall Customers Data),” J. Inf. Technol. Its Util., vol. 6, no. 2, pp. 45–50, Dec. 2023, doi: 10.56873/jitu.6.2.5243.
P. Jarupunphol, S. Kuptabut, and W. Sudjarid, “Evaluating K-Means and K-Medoids clustering for household poverty analysis using random forests,” Multidiscip. Sci. J., vol. 7, no. 11, p. 2025557, May 2025, doi: 10.31893/multiscience.2025557.
K. M. Kapiluka, H. Wijayanto, and A. Fitrianto, “Cluster Analysis Of Multivariate Panel Data On Data Containing Outliers,” BAREKENG J. Ilmu Mat. dan Terap., vol. 20, no. 1, pp. 0439–0452, Nov. 2025, doi: 10.30598/barekengvol20iss1pp0439-0452.
M. Bipul Hossen and M. Rabiul Auwul, “Comparative Study of K-Means, Partitioning Around Medoids, Agglomerative Hierarchical, and DIANA Clustering Algorithms by Using Cancer Datasets,” Biomed. Stat. Informatics, vol. 5, no. 1, p. 20, 2020, doi: 10.11648/j.bsi.20200501.14.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Hisyan Qiyad Al-Fityan, Diqy Fakhrun Shiddieq, Fikri Fahru Roji

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Copyright © by Author; Published by Institut Riset dan Publikasi Indonesia (IRPI)
This Indonesian Journal of Machine Learning and Computer Science is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.










