Model for identifying high-achieving students using the k-means clustering algorithm and c4.5 classification
DOI:
https://doi.org/10.35134/komtekinfo.v13i2.681Keywords:
Student Achievement, K-Means Clustering, C4.5 Algorithm, Classification, Decision TreeAbstract
Student achievement refers to academic accomplishments or results obtained by students in the field of education, which can influence the process of determining student academic grades, class achievement, and accomplishments. This process plays a strategic role in supporting objective educational decision-making, especially in the preparation of coaching programs, the establishment of awards, and the continuous development of student potential. Based on this, the purpose of this study is to analyze data on high-achieving students using the K-Means and C4.5 algorithms. The research methods used include K-means, which functions to group student data into different groups. C4.5 classification is capable of analyzing data characteristic similarities, and the results of the decision tree are used as the basis for the decision-making process. The dataset in this study consisted of 345 students from SMK Negeri 3 Padangsidimpuan. Based on the results of this study, it was proven that the application of the K-Means and C4.5 algorithms could achieve an accuracy of 98.59%. This research contributes to identifying high-achieving students at SMKN 3 Padangsidimpuan using the K-Means and C4.5 algorithms, which can assist the school in formulating more effective and targeted guidance policies and presenting the results of identifying high-achieving students after clustering and decision tree analysis. This serves as a basis for decision-making in determining student development programs based on objectively identified academic and non-academic achievement clusters.
References
R. S. Mentari and M. Iqbal, “Student Data Analysis for Decision Making Using Decision Tree,” Journal of Information Technology, computer science and Electrical Engineering, vol. 1, no. 3, pp. 517–521, 2024.
X. Li and L. Yuan, “Using Multiple Data Mining Technologies to Analyze Process Evaluation in the Blended-Teaching Environment,” Sustainability, vol. 15, no. 5, p. 4075, 2023.
L. R. Ilmi and M. Sumunaringtyas, “Clustering of High School Quality Using Fuzzy C-Means in the Special Region of Yogyakarta Province,” Kinetik: Game Technology, Information System, Computer Network, Computing, Electronics, and Control, 2025.
N. R. Jevintya, U. Darussalam, and S. Abdullah, “Application of the K-Means and Decision Tree Algorithms in Determining Student Achievement,” JIKO (Jurnal Informatika Dan Komputer), vol. 7, no. 1, pp. 13–18, 2024.
H. Shi, Y. Zhou, V. P. Dennen, and J. Hur, “From unsuccessful to successful learning: profiling behavior patterns and student clusters in Massive Open Online Courses,” Educ. Inf. Technol. (Dordr)., vol. 29, no. 5, pp. 5509–5540, 2024.
B. Pansri et al., “Understanding Student Learning Behavior: Integrating the Self-Regulated Learning Approach and K-Means Clustering.,” Educ. Sci. (Basel)., vol. 14, no. 12, 2024.
K. Ouassif, B. Ziani, J. Herrera-Tapia, and C. A. Kerrache, “Empowering Education: Leveraging Clustering and Recommendations for Enhanced Student Insights,” Educ. Sci. (Basel)., 2025.
J. Zhang, Y. Kuang, and J. Zhou, “Data Mining Technology for Smart Campus in Behavior Association Analysis of College Students,” Scalable Computing: Practice and Experience, vol. 25, no. 6, pp. 5701–5713, 2024.
A. Korcz et al., “Cluster analysis of physical activity and physical fitness and their associations with components of school skills in children aged 8–9 years,” Sci. Rep., vol. 15, no. 1, p. 5053, 2025.
S. Kumar, R. Rani, S. K. Pippal, and R. Agrawal, “Customer segmentation in e-commerce: K-means vs hierarchical clustering,” TELKOMNIKA (Telecommunication Computing Electronics and Control), vol. 23, no. 1, pp. 119–128, 2025.
A. M. Ikotun, A. E. Ezugwu, L. Abualigah, B. Abuhaija, and J. Heming, “K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data,” Inf. Sci. (N Y)., vol. 622, pp. 178–210, 2023.
H. Hendri et al., “A hybrid data mining for predicting scholarship recipient students by combining K-means and C4. 5 methods,” Indonesian Journal of Electrical Engineering and Computer Science, vol. 33, no. 3, pp. 1726–1735, 2024.
E. V. Astuti, A. Afandi, and D. M. Efendi, “Classification and Clustering of Internet Quota Sales Data Using C4. 5 Algorithm and K-Means,” Jurnal Ilmiah Teknik Elektro Komputer dan Informatika (JITEKI), vol. 9, no. 2, pp. 268–283, 2023.
R. Wandri, Y. Arta, A. Hanafiah, and R. Oktaviaani, “Prediction of Student Scholarship Recipients Using the K-Means Algorithm and C4. 5,” The Indonesian Journal of Computer Science, vol. 12, no. 1, 2023.
S. Sukriadi and S. Suherman, “Penerapan Data Mining Untuk Klasifikasi Penerima Beasiswa Di SMK Negeri 3 Soppeng Menggunakan Metode Decision Tree,” Jurnal RISTER: Riset Sistem Cerdas, vol. 1, no. 2, pp. 68–73, 2024.
Y. Xie, “Efficiency of Hybrid Decision Tree Algorithms in Evaluating the Academic Performance of Students.,” International Journal of Advanced Computer Science & Applications, vol. 15, no. 2, 2024.
R. Ishak and A. Bengnga, “Clustering Prestasi Akademik Lulusan Menggunakan Metode K-Means,” Jambura Journal of Electrical and Electronics Engineering, vol. 6, no. 1, pp. 76–81, 2024.
A. Ramadhanu, H. Hendri, F. Hadi, D. Guswandi, D. M. Putra, R. Hardianto, and S. D. Rizki, “Hybrid decision support system and image processing for classifying priority applications in the Padang Government,” CSRID (Computer Science Research and Its Development Journal), vol. 18, no. 1, pp. 178–191, 2026.
A. Ramadhanu, H. Hendri, and F. Hadi, “Organic fertilizer content detection based on image segmentation and texture analysis,” in Proc. 2025 International Conference on Informatics, Multimedia, Cyber and Information System (ICIMCIS), Dec. 2025, pp. 50–55.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Jurnal KomtekInfo

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


