Analisis Pengaruh Distance Metric Pada Algoritma K-Medoids Dalam Pengelompokan Kinerja Guru Menggunakan Silhouette Coefficent
DOI:
https://doi.org/10.29408/jit.v9i2.34814Keywords:
K-Medoids, Euclidean Distance, Manhattan Distance, Cosine Similarity, Silhoeutte Coefficient, ClusteringAbstract
This study aims to analyze the effect of distance metrics on the K-Medoids algorithm in clustering teacher performance based on pedagogical, personality, social, and professional indicators. This study was conducted because previous research on teacher performance clustering has generally focused more on the use of clustering algorithms without comparatively evaluating the effect of distance metric selection on the quality of the resulting clusters. The research data were obtained from assessor evaluations of teacher performance at SD Islam Al-Irsyad involving 16 teacher data records, which were first normalized to standardize the scale among attributes before the clustering process was carried out. Clustering was performed using the K-Medoids algorithm with Euclidean, Manhattan, and Cosine distance methods, as well as variations in the number of clusters (K) from 2 to 5 using RapidMiner. The clustering results were evaluated using the Silhouette Coefficient method calculated with Python to determine the cluster quality and the optimal number of clusters. The results showed that the highest Silhouette Coefficient value of 0.290 was obtained at K=4 using the Euclidean and Manhattan methods. Based on these results, the Euclidean method was selected as the best method because it is more widely used and capable of representing the distance between data points more effectively. The clustering results were then analyzed by assigning labels to each cluster based on the average value of the indicators to facilitate interpretation. Thus, this study demonstrates that the selection of distance metrics affects the quality of clustering results in teacher performance grouping.
References
[1] E. Rahmah, E. Haerani, A. Nazir, and S. Ramadhani, ‘Penerapan Algoritma K-Medoids Clustering Untuk Menentukan Srategi Promosi Pada Data Mahasiswa (Studi Kasus : Stikes Perintis Padang)’, Jurnal Nasional Komputasi dan Teknologi Informasi (JNKTI), vol. 5, no. 3, pp. 556–564, May 2022, doi: 10.32672/jnkti.v5i3.4355.
[2] A. A. D. Sulistyawati and M. Sadikin, ‘Penerapan Algoritma K-Medoids Untuk Menentukan Segmentasi Pelanggan’, SISTEMASI, vol. 10, no. 3, p. 516, May 2021, doi: 10.32520/stmsi.v10i3.1332.
[3] Oktavian, D. Hartama, and Selli, ‘Optimization Of K-Means And K-Medoids Clustering Using Dbi Silhouette Elbow On Student Data’, JURTEKSI (Jurnal Teknologi dan Sistem Informasi), vol. 11, no. 2, pp. 289–296, May 2025, doi: 10.33330/jurteksi.v11i2.3531.
[4] M. F. Tri and Y. Nataliani, ‘Analisis Pengaruh Penilaian Asesor terhadap Kinerja Guru Mata Pelajaran dengan k-Means Clustering’, Indonesian Journal of Computing and Modeling, vol. 4, no. 1, pp. 14–22, May 2021, doi: 10.24246/icm.v4i1.5063.
[5] S. Bahri and D. M. Midyanti, ‘Penerapan Metode K-Medoids untuk Pengelompokan Mahasiswa Berpotensi Drop Out’, Jurnal Teknologi Informasi dan Ilmu Komputer, vol. 10, no. 1, pp. 165–172, May 2023, doi: 10.25126/jtiik.20231016643.
[6] R. Hidayati, A. Zubair, A. H. Pratama, and L. Indana, ‘Analisis Silhouette Coefficient pada 6 Perhitungan Jarak K-Means Clustering’, Techno Com, vol. 20, no. 2, pp. 186–197, May 2021, doi: 10.33633/tc.v20i2.4556.
[7] R. Rahmawati, W. Prihartono, and Fathurrohman, ‘Optimasi Stok Dengan Clustering Data Transaksi Penjualan Menggunakan Algoritma K-Means Di Konter Agung Cell’, Jurnal Informatika dan Teknik Elektro Terapan, vol. 13, no. 2, May 2025, doi: 10.23960/jitet.v13i2.6302.
[8] N. Mirantika, T. S. Syamfithriani, and R. Trisudarmo, ‘Implementasi Algoritma K-Medoids Clustering Untuk Menentukan Segmentasi Pelanggan’, vol. 17, pp. 2614–5405, doi: 10.25134/nuansa.
[9] Solikhun, M. R. Siregar, L. Pujiastuti, M. Wahyudi, and D. Kurniawan, ‘Comparison of Manhattan and Chebyshev Distance Metrics in Quantum-Based K-Medoids Clustering’, SISTEMASI, vol. 14, no. 4, p. 1562, May 2025, doi: 10.32520/stmsi.v14i4.5193.
[10] A. P. Ayuni, D. Kusnandar, and S. Martha, ‘Implementasi Algoritma K-Medoids Dan Clustering Large Applications (Clara) Dengan Optimasi Silhouette Coefficient (Studi Kasus: Pengelompokan Indeks Pembangunan Manusia Berdasarkan Kabupaten/Kota di Indonesia)’, 2024.
[11] D. Ramadhaniaty, N. Puspitasari, and A. Septiarini, ‘Clustering Status Keberlanjutan Karyawan Kontrak Menggunakan Algoritma K-Medoids’, TELKA - Telekomunikasi Elektronika Komputasi dan Kontrol, vol. 10, no. 2, pp. 97–108, May 2024, doi: 10.15575/telka.v10n2.97-108.
[12] A. M. Nur, Yahya, Suhartini, and R. FIlkhaer, ‘Penerapan Algoritma K-Means Dalam Mengelompokkan Ruang Pasien BPJS Untuk Menentukan Pola Perawatan Kesehatan Yang Efektif’, Infotek Jurnal Informatika dan Teknologi, vol. 9, no. 1, pp. 174–185, May 2026, doi: 10.29408/jit.v9i1.33079.
[13] H. Sulaiman, Y. Yuliani, K. Panggalih, M. I. Alifudin, and K. Widianto, ‘Pengelompokan Keaktifan Anggota Perpustakaan Menggunakan Algoritma K-Means’, Infotek Jurnal Informatika dan Teknologi, vol. 8, no. 1, pp. 56–65, May 2025, doi: 10.29408/jit.v8i1.27978.
[14] M. S. Pangestu and M. A. Fitriani, ‘Perbandingan Perhitungan Jarak Euclidean Distance, Manhattan Distance, dan Cosine Similarity dalam Pengelompokan Data Bibit Padi Menggunakan Algoritma K-Means’, Sainteks, vol. 19, no. 2, p. 141, May 2022, doi: 10.30595/sainteks.v19i2.14495.
[15] E. L. Amalia, A. J. Jumadi, I. A. Mashudi, and D. W. Wibowo, ‘Analisis Metode Cosine Similarity Pada Aplikasi Ujian Online Otomatis (Studi Kasus JTI POLINEMA)’, Jurnal Teknologi Informasi dan Ilmu Komputer, vol. 8, no. 2, pp. 343–348, May 2021, doi: 10.25126/jtiik.2021824356.
[16] N. Sutantri, V. Yunitasari, G. R. Sa’adi, S. Ananda, and Z. Alfian, ‘Analisis Konsistensi Metode Elbow dan Silhouette Score dalam Klasterisasi pada Dataset Multisektor’, Journal of Innovative and Creativity (Joecy), vol. 5, no. 2, pp. 10731–10743, May 2025, doi: 10.31004/joecy.v5i2.1690.
[17] B. Wira, A. E. Budianto, and A. S. Wiguna, ‘Implementasi Metode K-Medoids Clustering Untuk Mengetahui Pola Pemilihan Program Studi Mahasiwa Baru Tahun 2018 Di Universitas Kanjuruhan Malang’, Rainstek Jurnal Terapan Sains dan Teknologi, vol. 1, no. 3, pp. 53–68, May 2019, doi: 10.21067/jtst.v1i3.3046.
[18] I. Ulfailah, A. Darmiyanti, and N. Munafiah, ‘Pengembangan Kompetensi Profesionalisme Guru Dalam Peningkatan Mutu Pendidikan Dan Pembelajaran’, JEA (Jurnal Edukasi AUD), vol. 8, no. 2, p. 169, May 2023, doi: 10.18592/jea.v8i2.7735.
[19] N. Widiawati, B. N. Sari, and T. N. Padilah, ‘Clustering Data Penduduk Miskin Dampak Covid-19 Menggunakan Algoritma K-Medoids’, Journal of Applied Informatics and Computing, vol. 6, no. 1, pp. 55–63, May 2022, doi: 10.30871/jaic.v6i1.3266
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Infotek: Jurnal Informatika dan Teknologi
This work is licensed under a Creative Commons Attribution 4.0 International License.
Semua tulisan pada jurnal ini menjadi tanggung jawab penuh penulis. Jurnal Infotek memberikan akses terbuka terhadap siapapun agar informasi dan temuan pada artikel tersebut bermanfaat bagi semua orang. Jurnal Infotek ini dapat diakses dan diunduh secara gratis, tanpa dipungut biaya sesuai dengan lisense creative commons yang digunakan.
Jurnal Infotek is licensed under a Creative Commons Attribution 4.0 International License.
Statistik Pengunjung
