Clustering Student Competencies Using the K-Means Algorithm

Authors

  • Ratih Friska Dwi Andini universitas sebelas maret
  • Febri Liantoni
  • Aris Budianto

DOI:

https://doi.org/10.31937/ti.v17i1.4071

Abstract

  This study aims to evaluate the effectiveness of the K-Means algorithm in clustering student competencies. The subject of the study is students of the Informatics and Computer Engineering Education study program at a public university in Indonesia, with course score data representing various areas of competence as features. The K-Means algorithm is used to group student data into several clusters based on academic grade patterns. The results show that the K-Means algorithm is quite effective in identifying the initial pattern of student competence, with a Silhouette Score of 0.3489, which falls into the medium category. This study concludes that the use of the K-Means algorithm alone is sufficient to support the analysis of student areas of competence, with potential applications as a recommendation system for students in choosing elective courses and as an evaluation tool for study programs to identify areas of competence that need improvement.

Downloads

Download data is not yet available.

Additional Files

Published

2025-07-01

How to Cite

Andini, R. F. D., Liantoni, F., & Budianto, A. (2025). Clustering Student Competencies Using the K-Means Algorithm. Ultimatics : Jurnal Teknik Informatika, 17(1), 99–106. https://doi.org/10.31937/ti.v17i1.4071