Application of K-Means Clustering for Student Class Division System
DOI:
https://doi.org/10.71302/jbidai.v6i2.35Keywords:
K-Means, Clustering, Pembagian, Kelas, SiswaAbstract
SMP Negeri 2 Malinau Utara is a junior high school in Desa Putat, Malinau Utara, Malinau, Kalimantan Utara and has 127 students. Currently, the class division process is inefficient and random. On the other hand, the clustering process' class division must be able to provide each class a balanced number of students. This study proposes the grades of Indonesian and English languages, Mathematics, and Natural Sciences for the clustering. K-means is applied to evenly group students based on predetermined value criteria to achieve the expected class formation. K-Means Clustering is an algorithm in data analysis to group a set of data into several groups based on their similar characteristics. In the clustering process, the distance between the data and the Centroid was calculated using the Euclidean Distance. Initial centroid determination and data distance calculation with the initial centroid were performed until the centroid member remains unchanged. The initial centroid was determined using a combination of 1,081 times obtained from 47 data combinations for two clusters. This research has been successfully applied to classify students using the K-Means Clustering method and select a balanced number of students between one class and another. Next, combine some students in each cluster with other clusters, so that each class has different levels of learning ability. With the combination of two clusters in one class, it is expected that students can help each other during the learning process.
References
[1] A. Sulistiyawati and E. Supriyanto, “Implementasi Algoritma K-means Clustring dalam Penetuan Siswa Kelas Unggulan,” vol. 15, no. 2.
[2] N. Nurahman, A. Purwanto, and S. Mulyanto, “Klasterisasi Sekolah Menggunakan Algoritma K-Means berdasarkan Fasilitas, Pendidik, dan Tenaga Pendidik,” MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer, vol. 21, no. 2, pp. 337–350, Mar. 2022, doi: 10.30812/matrik.v21i2.1411.
[3] Siti Hardianti, Sinawati, and Dikky Praseptian M., “Implementasi Clustering dengan Metode Minimum Spanning Tree untuk Pengelompokan Siswa berdasarkan Nilai Hasil Studi,” Journal of Big Data Analytic and Artificial Intelligence (JBIDAI), vol. 4, no. Vol. 4 No. 1 (2018): JBIDAI, pp. 23–28, 2018.
[4] R. Nainggolan and G. Lumbantoruan, “METHOMIKA: Jurnal Manajemen Informatika & Komputerisasi Akuntansi OPTIMASI PERFORMA CLUSTER K-MEANS MENGGUNAKAN SUM OF SQUARED ERROR (SSE) 1,” vol. 2, no. 2, 2018, doi: 10.46880/jmika.Vol2No2.pp103-108.
[5] C. Selvi, D. Sembiring, L. Hanum, and S. Parsaoran Tamba, “PENERAPAN DATA MINING MENGGUNAKAN ALGORITMA K-MEANS UNTUK MENENTUKAN JUDUL SKRIPSI DAN JURNAL PENELITIAN (STUDI KASUS FTIK UNPRI),” Jurnal Sistem Informasi dan Ilmu Komputer Prima), vol. 5, no. 2, 2022.
Downloads
Published
How to Cite
Issue
Section
License

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







