Analisis Komparatif Algoritma K-Means dan K-Medoids dalam Klasterisasi Minat Belajar Siswa MDTA Qur'an Kisaran

William Ramdhan

doi:10.47065/mis.v4i3.3116

William Ramdhan * Universitas Royal, Indonesia

DOI: https://doi.org/10.47065/mis.v4i3.3116

Keywords: Data Mining; K-Means; K-Medoids; Klasterisasi; Minat Belajar; MDTA

Abstract

Learning interest is one of the important factors that influence student success in following the learning process. However, identification of students' learning interest levels is often done subjectively so that it is less able to describe the student's condition as a whole. This study aims to compare the performance of the K-Means and K-Medoids algorithms in grouping the learning interests of MDTA Qur'an Kisaran students based on academic and non-academic data. The dataset used consists of 119 students with six variables, namely academic grades, attendance percentage, memorization assessment, Qur'an reading ability, moral assessment, and student participation. The clustering process was carried out with three clusters representing the categories of high, medium, and low learning interest. Cluster quality evaluation was carried out using the Davies-Bouldin Index (DBI) and Silhouette Coefficient. The results showed that the K-Means algorithm produced a DBI value of 1.5839 and a Silhouette of 0.2186, while the K-Medoids algorithm produced a DBI value of 1.5950 and a Silhouette of 0.2046. Based on the evaluation results, the K-Means algorithm performed better than K-Medoids in clustering student learning interests. The clustering results can be used to support decision-making in student development, developing learning strategies, and selecting participants for the Inter-Islamic Sports and Arts Week (PORSADIN) in a more objective and data-driven manner.

References

A. Muis et al., DATA MINING : Konsep , Metode , dan Aplikasi, 1st ed. Medan: FAASLIB SERAMBI MEDIA, 2025.

R. Liu, “Data Analysis of Educational Evaluation Using K-Means,” Comput. Intell. Neurosci., vol. 2022, p. 10, 2022, doi: https://doi.org/10.1155/2022/3762431.

R. Wenda and D. Kurniawan, “Personalized Student Learning Mechanisms using K- Means and K-Medoids Clustering Algorithms based on Individual Preferences,” Int. J. Comput. Appl., vol. 185, no. 46, pp. 13–19, 2023.

I. N. M. Alawi, S. J. S., Shaharanee and J. M. Jamil, “CLUSTERING STUDENT PERFORMANCE DATA USING k-MEANS ALGORITHMS,” J. Comput. Innov. Anal., vol. 2, no. 1, pp. 41–55, 2023.

U. Badhera, A. Verma, and P. Nahar, “Applicability of K-medoids and K-means algorithms for segmenting students based on their scholastic performance,” J. Stat. Manag. Syst. ISSN, vol. 22, no. 7, p. 11, 2022, doi: 10.1080/09720510.2022.2130566.

Q. Qomariyah and M. U. Siregar, “Comparative Study of K-Means Clustering Algorithm and K-Medoids Clustering in Student Data Clustering,” JISKA (Jurnal Inform. Sunan Kalijaga), vol. 7, no. 2, pp. 91–99, 2022.

F. N. Siagian and H. Maulana, “Perbandingan Kinerja K-Means dan K-Medoids dalam Klasifikasi Siswa Berprestasi di SMP Muhammadiyah 60 Medan,” Inven. J. Sci. , Technol. , Innov., vol. 1, no. 3, 2026.

S. Kaligis, Gideon Bartolomeus Yulianto, “ANALISA PERBANDINGAN ALGORITMA K-MEANS, K- MEDOIDS, DAN X-MEANS UNTUK PENGELOMPOKKAN KINERJA PEGAWAI,” J. Penerapan Teknol. Inf. dan Komun., vol. 01, no. 3, pp. 179–193, 2022.

C. Schröer, F. Kruse, J. Marx, F. Kruse, and J. Marx, “ScienceDirect ScienceDirect A Systematic Literature Review A Systematic Literature Review on Applying Process Model on Applying CRISP-DM Process Model,” Procedia Comput. Sci., vol. 181, no. 2019, pp. 526–534, 2021, doi: 10.1016/j.procs.2021.01.199.

J. Han, J. Pei, and H. Tong, DATA MINING CONCEPTS AND TECHNIQUES, FOURTH. Cambrige: Katey Birtcher, 2023.

W. Ramdhan, N. Nurwati, and E. Rahayu, “ANALISIS DATA EKSPLORATORI DAN CLUSTERING K-MODES UNTUK PEMETAAN STATUS GIZI BALITA PADA KASUS STUNTING DI KABUPATEN ASAHAN,” J. Sci. Soc. Res., vol. 4307, no. 4, pp. 3635–3644, 2025, [Online]. Available: https://jurnal.goretanpena.com/index.php/JSSR/article/view/4192/2204

F. Y. Arini, L. A. Djuanda, A. Hisma, and P. Kristianto, “Performance Evaluation of Gradient Boosting Techniques for Predicting Customer Purchase Decisions,” vol. 7, no. 2, pp. 1441–1454, 2026.

C. Fan, M. Chen, X. Wang, J. Wang, and B. Huang, “A Review on Data Preprocessing Techniques Toward Ef fi cient and Reliable Knowledge Discovery From Building Operational Data,” Front. Energy Res., vol. 9, no. March, pp. 1–17, 2021, doi: 10.3389/fenrg.2021.652801.

T. ALASALI and Y. ORTAKCI, “Clustering Techniques in Data Mining: A Survey of Methods, Challenges, and Applications,” J. Comput. Sci., vol. 9, no. 1, pp. 32–50, 2024.

O. Chorna, P. Didyk, S. Titov, and O. Titova, “USAGE OF CLUSTERING ALGORITHMS FOR AUTOMATING ROUTE PLANNING Summary of the main material,” Системи обробки інформації, vol. 1, no. 176, pp. 115–123, 2024, doi: 10.30748/soi.2024.176.14.

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, 2021, doi: 10.1016/j.is.2021.101804.

S. Pitafi, T. Anwar, and Z. Sharif, “A Taxonomy of Machine Learning Clustering Algorithms , Challenges , and Future Realms,” 2023, doi: https://doi.org/10.3390/ app13063529 Academic.

M. Shutaywi and N. N. Kachouie, “Silhouette Analysis for Performance Evaluation in Machine with Applications to Clustering,” Entropy, pp. 1–17, 2021, doi: https://doi.org/10.3390/e23060759 1.

A. A. A. Fernandes, M. Koehler, N. Konstantinou, P. Pankin, and N. W. Paton, “Data Preparation : A Technological Perspective and Review,” SN Comput. Sci., vol. 4, no. 4, pp. 1–20, 2025, doi: 10.1007/s42979-023-01828-8.

S. E. Kassab, M. Al Eraky, W. El Sayed, H. Hamdy, and H. Schmidt, “Measurement of student engagement in health professions education : a review of literature,” BMC Med. Educ., pp. 1–14, 2023, doi: 10.1186/s12909-023-04344-8.