Penerapan Metode K-Means Untuk Clustering Mahasiswa Berdasarkan Nilai Akademik Dengan Weka Interface Studi Kasus Pada Jurusan Teknik Informatika UMM Magelang

• Main Authors: Asroni Asroni, Ronald Adrian
• Format: Article
• Language: English
• Published: Universitas Muhammadiyah Yogyakarta 2016-01-01
• Series: Semesta Teknika
• Subjects: clustering, k-means, algorithm
• Online Access: https://journal.umy.ac.id/index.php/st/article/view/708
• ISSN: 1411-061X; 2502-5481

<p class="Abstract">The selection process among outstanding students in a department has a big problem. This process is not fair because only involve one criteria and ignore the other criteria. We need the best student to participate in a competition held by the Indonesia Security Incident Response Team on Internet Infrastructure (ID SIRTII) of the Ministry of Communication and Information. This process uses Weka software to calculate the best student. It provides the various method to explore the data. One of them is clustering method. There are many algorithms in clustering method. In this research, we will investigate widely about one of that algorithms. Its name is K-Means. This algorithm (K-Means) will give the recommendations about the best student based on the cluster. It will represent the many clusters of a student group. The best cluster can be calculated more to get the names of the best students group. They are eligible to enter the competition.  K-means involve the GPA (Grade Point Average) and related course to support the academic skill in order to get the best student. This research helps the teacher select the best student to enter the competition. Many similar cases can use this algorithm in order to get the best student.</p>