Perbandingan Metode K-Means dan K-Medoids dalam Clustering Data Warga Binaan Pemasyarakatan
DOI:
https://doi.org/10.55606/jtmei.v5i1.6243Keywords:
Energy, Forecasting, Moving Average, Natural Gas Production, Time SeriesAbstract
The increasing number of prison inmates poses a serious challenge for correctional institutions in designing targeted and effective rehabilitation programs. This study aims to compare the performance of K-Means and K-Medoids algorithms in clustering inmate data based on demographic characteristics and crime types. The dataset consists of 2,889 inmate records with seven attributes, including age, gender, religion, sentence duration, crime type, detention status, and other relevant correctional information. The preprocessing stages include feature selection, missing value handling, outlier removal, label encoding, and data standardization using StandardScaler to ensure that all variables are suitable for clustering analysis. The optimal number of clusters was determined using the Elbow Method combined with the Silhouette Score, resulting in K = 3 for both algorithms. The evaluation results show that K-Means outperforms K-Medoids across three internal evaluation metrics, indicating better clustering compactness and separation. However, K-Medoids produces a more balanced and interpretable cluster distribution. Therefore, both methods can support correctional institutions in mapping inmate profiles and formulating more appropriate rehabilitation, supervision, and policy strategies for evidence-based decision making in modern correctional management and inmate development.
Downloads
References
Ahmed, M., Seraj, R., & Islam, S. M. S. (2020). The k-means algorithm: A comprehensive survey and performance evaluation. Electronics, 9(8), 1295. https://doi.org/10.3390/electronics9081295
Arbelaitz, O., Gurrutxaga, I., Muguerza, J., Perez, J. M., & Perona, I. (2020). An extensive comparative study of cluster validity indices. Pattern Recognition, 46(1), 243–256. https://doi.org/10.1016/j.patcog.2012.07.021
Arthur, D., & Vassilvitskii, S. (2007). K-means++: The advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1027–1035).
Brownlee, J. (2020). Data preparation for machine learning. Machine Learning Mastery.
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022). A comprehensive survey of clustering algorithms. Engineering Applications of Artificial Intelligence, 110, 104743. https://doi.org/10.1016/j.engappai.2022.104743
Febrianto, R., Nugroho, A. S., & Suwandi, H. (2023). Penerapan algoritma K-Means untuk pengelompokan narapidana berdasarkan jenis kejahatan di Lembaga Pemasyarakatan Kelas IIA. Jurnal Teknologi Informasi dan Ilmu Komputer, 10(2), 321–330.
Garcia, S., Luengo, J., & Herrera, F. (2021). Data preprocessing in data mining. Springer International Publishing.
Govender, P., & Sivakumar, V. (2020). Application of k-means and hierarchical clustering techniques for analysis of air pollution: A review (1980–2019). Atmospheric Pollution Research, 11(1), 40–56. https://doi.org/10.1016/j.apr.2019.09.009
Han, J., Pei, J., & Tong, H. (2022). Data mining: Concepts and techniques (4th ed.). Morgan Kaufmann.
Hidayat, R., Nugroho, H., & Kurniawan, T. (2022). Analisis data narapidana menggunakan teknik data mining untuk mendukung kebijakan pemasyarakatan. Jurnal Sistem Informasi, 18(1), 56–67.
Kaufman, L., & Rousseeuw, P. J. (2009). Finding groups in data: An introduction to cluster analysis. John Wiley & Sons.
Krishnaraj, N., Elhoseny, M., Thenmozhi, M., Selim, M. M., & Shankar, K. (2021). Deep learning model for real-time image compression in Internet of Underwater Things (IoUT). Journal of Real-Time Image Processing, 18(6), 1919–1929.
Park, H. S., & Jun, C. H. (2022). A simple and fast algorithm for K-medoids clustering. Expert Systems with Applications, 36(2), 3336–3341. https://doi.org/10.1016/j.eswa.2008.01.039
Prasetyo, E., & Sukmono, R. A. (2022). Comparative analysis of K-Means and K-Medoids clustering algorithms on healthcare data. International Journal of Advanced Computer Science and Applications, 13(5), 214–221.
Rahim, R., Susanto, H., & Fitriani, A. (2023). Perbandingan kinerja K-Means dan K-Medoids pada data rekam medis pasien. Jurnal Informatika dan Rekayasa Elektronik, 6(1), 45–54.
Rousseeuw, P. J. (1987). Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. Journal of Computational and Applied Mathematics, 20, 53–65. https://doi.org/10.1016/0377-0427(87)90125-7
Sarkar, D., Bali, R., & Ghosh, T. (2021). Practical machine learning with Python. Apress.
Schubert, E., & Rousseeuw, P. J. (2021). Fast and eager k-medoids clustering: O(k) runtime improvement of the PAM, CLARA, and CLARANS algorithms. Information Systems, 101, 101804. https://doi.org/10.1016/j.is.2021.101804
Shih, M. Y., Jheng, J. W., & Lai, L. F. (2021). A two-step method for clustering mixed categorical and numerical data. Tamkang Journal of Science and Engineering, 13(1), 11–19.
Susanto, B., & Rahayu, S. (2022). Hierarchical clustering untuk identifikasi pola recidivism pada data narapidana lembaga pemasyarakatan. Jurnal Ilmu Komputer dan Informatika, 8(2), 89–98.
Syakur, M. A., Khotimah, B. K., Rochman, E. M. S., & Satoto, B. D. (2018). Integration K-Means clustering method and elbow method for identification of the best customer profile cluster. IOP Conference Series: Materials Science and Engineering, 336(1), 012017. https://doi.org/10.1088/1757-899X/336/1/012017
Thinsungnoen, T., Kaoungku, N., Durongdumronchai, P., Kerdprasop, K., & Kerdprasop, N. (2020). The clustering validity with silhouette and sum of squared errors. In Proceedings of the 3rd International Conference on Industrial Application Engineering (pp. 44–51). https://doi.org/10.12792/iciae2015.012
Wulandari, D., Permatasari, I., & Nurhayati, E. (2023). Analisis klasterisasi data kejahatan menggunakan K-Means dan K-Medoids: Studi kasus Kota Bandung. Jurnal Riset Informatika, 5(2), 103–112.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Marta Yunita Pangaribuan, Christian Dwi Suhendra, Lion Ferdinand Marini
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
