Clustering Student Competencies Using the K-Means Algorithm
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...
Uloženo v:
| Vydáno v: | Ultimatics : Jurnal Teknik Informatika Ročník 17; číslo 1; s. 99 - 106 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
01.07.2025
|
| ISSN: | 2085-4552, 2581-186X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|---|
| ISSN: | 2085-4552 2581-186X |
| DOI: | 10.31937/ti.v17i1.4071 |