Clustering the Economic Conditions of Various Countries From 2010-2023 by Conducting A Comparative Analysis of the K-Means and K-Medoids Algorithms
Abstract
Understanding the similarities and differences in economic conditions across countries is crucial for various stakeholders. This research investigates the global economic landscape by clustering countries based on their economic indicators, including GDP, inflation rate, unemployment rate, and economic growth, spanning the period of 2010 to 2023. This timeframe encompasses significant global economic events, making it pertinent for analysis. The study employs and compares two prominent clustering algorithms: K-Means and K-Medoids, to identify groups of countries exhibiting similar economic patterns. Utilizing secondary data from Kaggle encompassing 19 countries, the research assesses the ability of each algorithm to delineate meaningful economic clusters. The K-Means algorithm, with a determined optimal number of four clusters, demonstrated a reasonably good cluster separation and moderate internal cohesion, evidenced by a Silhouette Coefficient of 0.58 and a Davies-Bouldin Index of 0.63. In contrast, the K-Medoids algorithm yielded a distinct clustering structure with a lower Silhouette Coefficient (0.26) and a higher Davies-Bouldin Index (1.16), suggesting less distinct cluster separation and potential sensitivity to data characteristics. This comparative analysis provides insights into the applicability and performance of K-Means and K-Medoids in discerning global economic structures, contributing to a deeper understanding of the world economic map and the utility of clustering techniques in economic data analysis.
Downloads
References
H.-L. Minh, T. Sang-To, M. A. Wahab, and T. Cuong-Le, “A new metaheuristic optimization based on K-means clustering algorithm and its application to structural damage identification,” Knowledge-Based Systems, vol. 251, p. 109189, 2022, doi: https://doi.org/10.1016/j.knosys.2022.109189.
M. I. Faizi and S. M. Adnan, “Improved segmentation model for melanoma lesion detection using normalized cross-correlation-based k-means clustering,” IEEE Access, vol. 12, pp. 20753–20766, 2024, doi: 10.1109/ACCESS.2024.3360223.
Z. Salman and A. Alomary, “Performance of the K-means and fuzzy C-means algorithms in big data analytics,” International Journal of Information Technology, vol. 16, no. 1, pp. 465–470, 2024, doi: https://doi.org/10.1007/s41870-023-01436-y.
J. Heidari, N. Daneshpour, and A. Zangeneh, “A novel K-means and K-medoids algorithms for clustering non-spherical-shape clusters non-sensitive to outliers,” Pattern Recognition, vol. 155, pp. 1–12, 2024, doi: https://doi.org/10.1016/j.patcog.2024.110639.
N. Hasdyna and R. K. Dinata, “Comparative Analysis of K-Medoids and Purity K-Medoids Methods for Identifying Accident-Prone Areas in North Aceh Regency,” Scientific Journal of Informatics, vol. 11, no. 2, pp. 263–272, 2024, doi: https://doi.org/10.15294/sji.v11i2.3433.
A. de Mathelin, N. E. Cecchi, F. Deheeger, M. Mougeot, and N. Vayatis, “OneBatchPAM: A Fast and Frugal K-Medoids Algorithm,” arXiv preprint arXiv:2501.19285, 2025, doi: https://doi.org/10.48550/arXiv.2501.19285.
Ö. N. Kenger, Z. D. Kenger, E. Özceylan, and B. Mrugalska, “Clustering of Cities Based on Their Smart Performances: A Comparative Approach of Fuzzy C-Means, K-Means, and K-Medoids,” IEEE Access, vol. 11, pp. 134446–134459, 2023, doi: 10.1109/ACCESS.2023.3333753.
E. Ermawati, I. Sriliana, and R. Sriningsih, “Clustering of state universities in indonesia based on productivity of scientific publications using K-Means and K-Medoids,” BAREKENG: Journal of Mathematics and Its Applications, vol. 17, no. 3, pp. 1617–1630, 2023, doi: https://doi.org/10.30598/barekengvol17iss3pp1617-1630.
L. P. Sari, A. Fanani, and A. H. Asyhar, “Analisis Perbandingan Pengelompokan Kota di Indonesia Berdasarkan Indikator Inflasi Tahun 2021 dengan Metode Ward dan K-Means,” Jurnal Sains Matematika dan Statistika (JSMS), vol. 9, no. 2, pp. 108–118, 2021, doi: http://dx.doi.org/10.24014/jsms.v9i2.21100.
F. Zahra, A. Khalif, and B. N. Sari, “Pengelompokan Tingkat Kemiskinan di Setiap Provinsi di Indonesia Menggunakan Algoritma K-Medoids,” JITET (Jurnal Informatika dan Teknik Elektro Terapan), vol. 12, no. 2, pp. 1243–1249, 2024, doi: http://dx.doi.org/10.23960/jitet.v12i2.4199.
Y. Liu, B. Li, S. Yang, and Z. Li, “Handling missing values and imbalanced classes in machine learning to predict consumer preference: Demonstrations and comparisons to prominent methods,” Expert systems with applications, vol. 237, p. 121694, 2024, doi: https://doi.org/10.1016/j.eswa.2023.121694.
A. Tharwat and W. Schenck, “Active learning for handling missing data,” IEEE Transactions on Neural Networks and Learning Systems, vol. 36, no. 2, pp. 3273–3287, 2024, doi: 10.1109/TNNLS.2024.3352279.
N. Kalpourtzi, J. R. Carpenter, and G. Touloumi, “Handling missing values in surveys with complex study design: a simulation study,” Journal of Survey Statistics and Methodology, vol. 12, no. 1, pp. 105–129, 2024, doi: https://doi.org/10.1093/jssam/smac039.
S. Kim, Y. Noh, Y.-J. Kang, S. Park, J.-W. Lee, and S.-W. Chin, “Hybrid data-scaling method for fault classification of compressors,” Measurement, vol. 201, p. 111619, 2022, doi: https://doi.org/10.1016/j.measurement.2022.111619.
T. T. Khoei and A. Singh, “Data reduction in big data: a survey of methods, challenges and future directions,” International Journal of Data Science and Analytics, pp. 1–40, 2024, doi: https://doi.org/10.1007/s41060-024-00603-z.
R. Shetty, M. Geetha, U. D. Acharya, and G. Shyamala, “Enhancing ovarian tumor dataset analysis through data mining preprocessing techniques,” IEEE Access, vol. 12, pp. 122300–122312, 2024, doi: 10.1109/ACCESS.2024.3450520.
R. Wu, “Behavioral analysis of electricity consumption characteristics for customer groups using the k-means algorithm,” Systems and Soft Computing, vol. 6, p. 200143, 2024, doi: https://doi.org/10.1016/j.sasc.2024.200143.
B. Wan, W. Huang, B. Pierre, Y. Cheng, and S. Zhou, “K-Means algorithm based on multi-feature-induced order,” Granular Computing, vol. 9, no. 2, p. 45, 2024, doi: https://doi.org/10.1007/s41066-024-00470-w.
G. Gwak, U. Hwang, and J. Kim, “Clustering of shoulder movement patterns using K-means algorithm based on the shoulder range of motion,” Journal of Bodywork and Movement Therapies, vol. 41, pp. 164–170, 2025, doi: https://doi.org/10.1016/j.jbmt.2024.11.034.
M. Chaudhry, “Optimized K-Medoid: A Comprehensive Approach to Medoid Discovery and Finding Optimal K,” College of Electrical & Mechanical Engineering (CEME), NUST, 2024.
L. Lenssen and E. Schubert, “Medoid Silhouette clustering with automatic cluster number selection,” Information Systems, vol. 120, p. 102290, 2024, doi: https://doi.org/10.1016/j.is.2023.102290.
Y. Mo, R. Xing, and H. Hou, “A Distributed Higher-Order $ k $-Medoids Clustering Algorithm for Network Partition,” IEEE Transactions on Network Science and Engineering, vol. 11, no. 5, pp. 4181–4193, 2024, doi: 10.1109/TNSE.2024.3402383.
M. Sahoo and S. Rai, “A partitioning around medoids (PAM) based sequential clustering approach for model order estimation of low-frequency oscillations in wide area measurement system,” Sādhanā, vol. 49, no. 1, p. 94, 2024, doi: https://doi.org/10.1007/s12046-023-02408-5.
N. Nurdin, F. Fajriana, R. Meiyanti, A. Adelia, and M. Maulita, “Clustering and Mapping of Agricultural Production Based on Geographic Information System Using K-Medoids Algorithm,” Journal of Artificial Intelligence and Technology, vol. 5, pp. 116–124, 2025, doi: https://doi.org/10.37965/jait.2025.633.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Clustering the Economic Conditions of Various Countries From 2010-2023 by Conducting A Comparative Analysis of the K-Means and K-Medoids Algorithms
Pages: 793-801
Copyright (c) 2025 Yunita Yunita, Hanifah Ekawati, Amelia Yusnita

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).





















