Pengelompokan Mahasiswa Berdasarkan Data Akademik Sebelum Kuliah dan Masa Studi Menggunakan K-Medoids

Herri Kurnia, Lisna Zahrotun, Utaminingsih Linarti

Abstract


The research objective is to obtain information about the results of clustering that are useful for the campus, especially study programs, to be used as consideration for future admissions by grouping, causing a mismatch between the number of students and the existing campus facilities. This research was conducted at university X which has several faculties, one of which is faculty Y which consists of the R study program, S study program, T study program and U study program. This research uses the K-Medoids method. The stages of this research started with load dataset, data cleaning, data selection, data transformation with one hot encoding, euclidean distance, and k-medoids to produce clusters. Testing the quality of the clusters in this study using the silhouette coefficient. The research resulted in recommended student data and all of them came from Java Island. In the dataset of study programs R, S, and U, the recommended data are obtained with a total number of 9, 57, and 64, respectively, which have an average math score of at least 82. Meanwhile, for the T study program dataset, there are 35 data with an average mathematical value. amounted to 73.89. The test results for the dataset of study programs R, S, T and U are 0.52, 0.67, 0.35, and 0.65 respectively, so the results are quite good.


Keywords


Clustering, K-Medoids, Euclidean Distance

Full Text:

PDF

References


W. Widarto, “Faktor Penghambat Studi Mahasiswa yang Tidak Lulus Tepat Waktu di Jurusan Pendidikan Teknik Mesin FT UNY,” J. Din. Vokasional Tek. Mesin, vol. 2, no. 2, p. 127, 2017.

D. Marlina, N. Lina, A. Fernando, and A. Ramadhan, “Implementasi Algoritma K-Medoids dan K-Means untuk Pengelompokkan Wilayah Sebaran Cacat pada Anak,” J. CoreIT J. Has. Penelit. Ilmu Komput. dan Teknol. Inf., vol. 4, no. 2, p. 64, 2018.

D. F. Pramesti, M. Tanzil Furqon, and C. Dewi, “Implementasi Metode K-Medoids Clustering Untuk Pengelompokan Data Potensi Kebakaran Hutan/Lahan Berdasarkan Persebaran Titik Panas (Hotspot),” J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 1, no. 9, pp. 723–732, 2017.

L. Zahrotun, “Analisis PengelompokkanJumlah Penumpang Bus Trans Jogja Menggunakan metode Clustering K-Means dan Agglomerative Hierarchical Clustering (AHC),” J. Inform., vol. 9, no. 1, pp. 1039–1047, 2015.

L. Zahrotun, N. hutami Putri, and A. N. Khusna, “The Implementation of K-Means Clustering Method in Classifying Undergraduate Thesisi Titles,” in 12th International Conference on Telecommunication Systems, Services, and Applications (TSSA), 2018.

L. Zahrotun, “Text Mining for Internship Titles Clustering Using Shared Nearest-Neighbor Method,” Comput. Eng. Appl., vol. 6, no. 3, 2017.

S. Defiyanti, M. Jajuli, and N. Rohmawati, “Optimalisasi K-MEDOID dalam Pengklasteran Mahasiswa Pelamar Beasiswa dengan CUBIC CLUSTERING CRITERION,” J. Nas. Teknol. dan Sist. Inf., vol. 3, no. 1, pp. 211–218, 2017.

N. K. Kaur, U. Kaur, and D. Singh, “K-Medoid Clustering Algorithm- A Review,” Int. J. Comput. Appl. Technol., vol. 1, no. 1, pp. 42–45, 2014.

R. Handoyo, R. Rumani, and S. M. Nasution, “Perbandingan Metode Clustering Menggunakan Metode Single Linkage Dan K-Means Pada Pengelompokan Dokumen,” JSM STMIK Mikroskil, vol. 15, no. 2, pp. 73–82, 2014.

M. B. Al- Zoubi and M. A. Rawi, “An Efficient Approach for Computing Silhouette Coefficients,” J. Comput. Sci., vol. 4, no. 3, pp. 252–255, 2008.

J. Han, Jiawei; Kamber, Micheline; Pei, Data mining: Data mining concepts and techniques. 2014.

W. Bagus, A. E. Budianto, and A. S. Wiguna, “Implementasi Metode K-Medoids Clustering untuk Mengetahui Pola Pemilihan Program Studi,” J. Terap. Sains Teknol., vol. 1, no. 3, pp. 54–69, 2019.

G. S. Nugraha, Hairani;, and R. F. P. Ardi, “Aplikasi Pemetaan Kualitas Pendidikan Di Indonesia Menggunakan Metode K-Means,” J. MATRIK, vol. 17, no. 2, pp. 13–23, 2018.




DOI: https://doi.org/10.30743/infotekjar.v5i2.3243

Refbacks

  • There are currently no refbacks.


Copyright (c) 2021 Herri Kurnia, Lisna Zahrotun, Utaminingsih Linarti

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

InfoTekJar (Jurnal Nasional Informatika dan Teknologi Jaringan)

Program Studi Teknik Informatika - Universitas Islam Sumatera Utara
Website : http://jurnal.uisu.ac.id/index.php/infotekjar/index
Email : infotekjar@ft.uisu.ac.id

InfoTekJar : Jurnal Nasional Informatika dan Teknologi Jaringan) is licensed under a Creative Commons Attribution 4.0 International License