Analisis Algoritma K-Means Clustering untuk Pengelompokan Rekomendasi Judul Proposal Tugas Akhir Mahasiswa
DOI:
https://doi.org/10.47065/bulletincsr.v5i5.755Keywords:
K-Means; Clustering; Student Grades; Fast; Accurate; AcademicAbstract
The academic process requires speed and accuracy in processing student data, such as submitting final project titles. In the context of final project title recommendations, many universities have not yet implemented the Data Mining approach optimally. Based on this, this study aims to recommend grouping of student final project proposal titles. The K-Means clustering method can be used in grouping data based on similarities between analyzed objects. With the K-Means method, the student grouping process utilizes grade data from the courses of Rock Mechanics, Drilling and Excavation Techniques, Underground Mining Methods, Reserve Modeling and Evaluation, Explosives and Blasting Techniques, Open Pit Mining, Mine Drainage Systems, Mapping Surveys, and Mineral Resources. The results of K-Means are strongly influenced by the k parameter and centroid initialization. The research variables include data mapping of course grades of students in the Mining Engineering Study Program. Based on the K-Means Clustering Method, it has been able to divide 104 student value data into 3 clusters, namely Natural Resource Exploration (C0), Geomechanics (C1) and Mining Environment (C2). The results of Cluster CO are 60, the results of Cluster C1 are 27 and the results of Cluster C2 are 17. The contribution of this research can provide fast, precise and accurate information in grouping recommendations for student final project proposal titles.
Downloads
References
M. R. Muttaqin and M. Defriani, “Algoritma K-Means untuk Pengelompokan Topik Skripsi Mahasiswa,” Ilk. J. Ilm., vol. 12, no. 2, pp. 121–129, 2020, doi: 10.33096/ilkom.v12i2.542.121-129.
H. Haviluddin, S. J. Patandianan, G. M. Putra, N. Puspitasari, and H. S. Pakpahan, “Implementasi Metode K-Means Untuk Pengelompokkan Rekomendasi Tugas Akhir,” Inform. Mulawarman J. Ilm. Ilmu Komput., vol. 16, no. 1, p. 13, 2021, doi: 10.30872/jim.v16i1.5182.
C. S. D. B. Sembiring, L. Hanum, and S. P. Tamba, “Penerapan Data Mining Menggunakan Algoritma K-Means Untuk Menentukan Judul Skripsi Dan Jurnal Penelitian (Studi Kasus Ftik Unpri),” J. Sist. Inf. dan Ilmu Komput. Prima(JUSIKOM PRIMA), vol. 5, no. 2, pp. 80–85, 2022, doi: 10.34012/jurnalsisteminformasidanilmukomputer.v5i2.2393.
Nisar, Wasilah, and H. Kusumajaya, “Pemanfaatan K Means Clustering dalam Pengelompokan Judul Skripsi,” J. JUPITER, vol. 14, no. 1, pp. 19–26, 2022.
O. Somantri, S. Wiyono, and D. Dairoh, “Metode K-Means untuk Optimasi Klasifikasi Tema Tugas Akhir Mahasiswa Menggunakan Support Vector Machine (SVM),” Sci. J. Informatics, vol. 3, no. 1, pp. 34–45, 2016, doi: 10.15294/sji.v3i1.5845.
M. Siahaan, “Data Mining Strategi Pembangunan Infrastruktur Menggunakan Algoritma K-Means,” J. Sisfokom (Sistem Inf. dan Komputer), vol. 11, no. 3, pp. 316–324, 2022, doi: 10.32736/sisfokom.v11i3.1453.
L. Pamungkas, N. A. Dewi, and N. A. Putri, “Classification of Student Grade Data Using the K-Means Clustering Method,” J. Sisfokom (Sistem Inf. dan Komputer), vol. 13, no. 1, pp. 86–91, 2024, doi: 10.32736/sisfokom.v13i1.1983.
I. Arwani, “Integrasi Algoritma K-Means Dengan Bahasa SQL Untuk Klasterisasi IPK Mahasiswa (Studi Kasus: Fakultas Ilmu Komputer Universitas Brawijaya),” J. Teknol. Inf. dan Ilmu Komput., vol. 2, no. 2, p. 143, 2015, doi: 10.25126/jtiik.201522148.
M. P. A. Ariawan, I. B. A. Peling, and G. B. Subiksa, “Prediksi Nilai Akhir Matakuliah Mahasiswa Menggunakan Metode K-Means Clustering (Studi Kasus?: Matakuliah Pemrograman Dasar),” J. Nas. Teknol. dan Sist. Inf., vol. 9, no. 2, pp. 122–131, 2023, doi: 10.25077/teknosi.v9i2.2023.122-131.
Y. Suhanda, I. Kurniati, and S. Norma, “Penerapan Metode Crisp-DM Dengan Algoritma K-Means Clustering Untuk Segmentasi Mahasiswa Berdasarkan Kualitas Akademik,” J. Teknol. Inform. dan Komput., vol. 6, no. 2, pp. 12–20, 2020, doi: 10.37012/jtik.v6i2.299.
Jackri Hendrik and Joni, “Perancangan Sistem Informasi Pengklasifikasian Rumah Sakit Menggunakan Algoritma K-Means Clustering,” Bull. Comput. Sci. Res., vol. 4, no. 2, pp. 225–232, 2024, doi: 10.47065/bulletincsr.v4i2.338.
A. Hardianti and D. Agushinta R, “Universitas Darma Persada Menggunakan Metode Clustering K-Means Pattern Analysis of the Student Study Period in the Faculty of Engineering At Darma Persada University Using K-Means,” J. Teknol. Inf. dan Ilmu Komput., vol. 7, no. 4, pp. 861–868, 2020, doi: 10.25126/jtiik.202071001.
R. Novita, A. N. Khomarudin, R. Aulia, J. Jamaluddin, A. Yuditihwa, and A. Ayuri, “Penerapan Algoritma K-Means dan Analisisnya untuk Menentukan Kebijakan Strategis Penyelesaian Studi Mahasiswa,” J. SAINTIKOM (Jurnal Sains Manaj. Inform. dan Komputer), vol. 22, no. 2, p. 401, 2023, doi: 10.53513/jis.v22i2.8461.
E. Arriyanti, S. Lailiyah, and A. Kurniawan, “Penerapan Metode K-Means Clustering Untuk Pengelompokan Judul Skripsi Mahasiswa (Studi Kasus: Stmik Widya Cipta Dharma),” Repository.Wicida.Ac.Id, [Online]. Available: https://repository.wicida.ac.id/5424/1/1943905-S1-JURNAL.pdf
N. W. Utami and I. G. J. Eka Putra, “Text Minig Clustering Untuk Pengelompokan Topik Dokumen Penelitian Menggunakan Algoritma K-Means Dengan Cosine Similarity,” J. Inform. Teknol. dan Sains, vol. 4, no. 3, pp. 255–259, 2022, doi: 10.51401/jinteks.v4i3.1907.
A. Bijaksana, P. Negara, H. Sasty, and A. Riza, “Implementasi Metode K-Means Clustering dan Algoritma Cosine Similarity pada Repository Digital Jurusan Informatika Implementation of K-Means Clustering Method and Cosine Similarity Algorithm on the Digital Repository of the Department of Informatics,” vol. 02, no. 2, pp. 15–28, 2024, doi: 10.26418/juara.v2i2.73974.
M. I. Asnada, B. Rahayudi, and A. Ridok, “Pengelompokan Topik Skripsi Mahasiswa Fakultas Ilmu Komputer Universitas Brawijaya berdasarkan Judul pada Periode 2015-2019 menggunakan Metode Semi Supervised K-Means,” J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 6, no. 1, pp. 58–65, 2022, [Online]. Available: https://j-ptiik.ub.ac.id/index.php/j-ptiik/article/view/10342
L. Kurniawan, A. Filiana, G. V. #3, B. Surya, and H. #4, “JEPIN (Jurnal Edukasi dan Penelitian Informatika) Sistem Rekomendasi Topik Skripsi Program Studi Informatika,” vol. 9, no. 2, pp. 307–315, 2023.
S. Suraya, M. Sholeh, and U. Lestari, “Evaluation of Data Clustering Accuracy using K-Means Algorithm,” Int. J. Multidiscip. Approach Res. Sci., vol. 2, no. 01, pp. 385–396, 2023, doi: 10.59653/ijmars.v2i01.504.
R. Dea Mustika, A. Zakir, and A. Rizmi, “Implementasi Algoritma K-Means Untuk Clustering Judul Skripsi Universitas Harapan Medan,” J. Media Inform., vol. 4, no. 1, pp. 40–47, 2022, doi: 10.55338/jumin.v4i1.405.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Analisis Algoritma K-Means Clustering untuk Pengelompokan Rekomendasi Judul Proposal Tugas Akhir Mahasiswa
ARTICLE HISTORY
How to Cite
Issue
Section
Copyright (c) 2025 Sandra Yulihartati, Sarjon Defit, Gunadi Widi Nurcahyo

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).













