Clustering of Lecturer Performance Based on Internal Data and Questionnaire Using the X-Means Algorithm
Main Article Content
Abstract
Lecturer performance evaluation is essential for improving the quality of higher education. In the Informatics Engineering Study Program at Universitas Muhammadiyah Jember, assessments are still conducted manually, leading to inefficiency and subjectivity. This study aims to cluster lecturer performance based on internal data—credit load, publications, attendance, and students’ average grades—and student perceptions collected through questionnaires, using the X-Means Clustering algorithm. X-Means was chosen because it can automatically determine the optimal number of clusters using the Bayesian Information Criterion (BIC) and log-likelihood. The research involved data collection, cleaning, normalization with the Min-Max method, implementation of X-Means, and visualization using Principal Component Analysis (PCA). The results identified five distinct clusters: high-performing lecturers, lecturers with high publication output, research-active lecturers with low student grades, low-performing lecturers, and stable-performing lecturers. These findings provide an objective view of lecturer performance variations and can serve as a basis for developing effective strategies for lecturer improvement and continuous performance evaluation
Article Details

This work is licensed under a Creative Commons Attribution 4.0 International License.
References
Agung, A., Daniswara, A., Kadek, I., & Nuryana, D. (2023). Data Preprocessing Pola Pada Penilaian Mahasiswa Program Profesi Guru. Journal of Informatics and Computer Science, 05, 97–100.
[2] Agustina, D., & Rahmawati, M. I. (2023). Pengaruh Leverage, Ukuran Perusahaan, dan Profitabilitas Terhadap Ketepatan Waktu Pelaporan Keuangan. Jurnal Ilmu Dan Riset Akuntansi, 12(1), 1–15.
[3] Fathuroh, S. (2022). Metode K-Means Clustering Dalam Optimalisasi Kinerja Dosen Pendamping Akademik Pada Program Kampus Merdeka. Jurnal Sistim Informasi Dan Teknologi, 5, 5–9. https://doi.org/10.37034/jsisfotek.v5i2.172
[4] Li, G., & Qin, Y. (2024). An Exploration of the Application of Principal Component Analysis in Big Data Processing. Applied Mathematics and Nonlinear Sciences, 9(1), 1–24. https://doi.org/10.2478/amns-2024-0664
[5] urfadilla, N., Afdal, M., Permana, I., & Zarnelly, Z. (2023). Comparison of Data Mining Algorithm for Clustering Patient Data Human Infectious Diseases. Jurnal Teknik Informatika (Jutif), 4(5), 1127–1134. https://doi.org/10.52436/1.jutif.2023.4.5.983
[6] Trianto, R. B., Nugroho, A. S., & Supriyadi, E. (2023). Klasterisasi Menggunakan Algoritma K-Means dan Elbow pada Opini Masyarakat Tentang Kebijakan Sekolah Luring Tahun 2022. INOVTEK Polbeng - Seri Informatika, 8(1), 1. https://doi.org/10.35314/isi.v8i1.2756
[7] Wijayanto, A. (2019). Penggunaan X-Means Clustering Method untuk Mengelompokkan Potensi Sekolah Menengah Unggul di Kabupaten Banyumas. Journal of Informatics, Information System, Software Engineering and Applications (INISTA), 2(1), 80–88. https://doi.org/10.20895/inista.v2i1.99
[8] Yunita, F. (2018). Penerapan Data Mining Menggunkan Algoritma K-Means Clustring Pada Penerimaan Mahasiswa Baru. Sistemasi, 7(3), 238. https://doi.org/10.32520/stmsi.v7i3.388
[9] Webster, A. J. (2020). Bayesian information criteria for clustering normally distributed data. Icl, 1–16. http://arxiv.org/abs/2008.03974
[10] Hao, X., Jiang, R., & Chen, T. (2011). Clustering 16S rRNA for OTU prediction: A method of unsupervised Bayesian clustering. Bioinformatics, 27(5), 611–618. https://doi.org/10.1093/bioinformatics/btq725