Klasifikasi Siswa Berprestasi Berdasarkan Nilai Akademik dan Non-Akademik dengan Menggunakan Metode Random Forest
Abstract
This study aims to develop a classification system for high-achieving students by integrating academic and non-academic aspects using the Random Forest method. The main problem faced by Natal State High School 1 is that the process of identifying high-achieving students still focuses on academic grades and does not yet comprehensively incorporate other indicators such as discipline, attendance, and extracurricular activities. This study employs a quantitative approach with data collection techniques including observation, interviews, and literature review. The data used were derived from the report cards for the odd-semester of the 2024/2025 academic year, covering 222 eleventh-grade students. The research stages included data preprocessing (data cleaning, transformation, normalization, and feature selection), data splitting using a stratified split (70% training data and 30% test data), and the application of the Random Forest algorithm for classification. The features used include average academic scores, absences (sick, excused, unexcused), and extracurricular activities. The results showed that the model performed very well, with an accuracy of 1.000 on the test data and an average cross-validation accuracy of 0.9865. Additionally, the precision, recall, and F1-score each reached 1.000. The classification results identified 13 students as high achievers, with the largest distribution coming from 11th grade class 1. These findings indicate that the Random Forest method is capable of producing accurate and consistent classifications and is effective in integrating various assessment indicators. This study is expected to support more objective and comprehensive decision-making within educational evaluation systems and to contribute to the development of more holistic classification models for assessing student success in school, based not only on academic achievement but also on important non-academic aspects.
Downloads
References
A. Muhaimin, M. A. Hariyadi, and M. Imamudin, “Klasifikasi Prestasi Akademik Siswa Berdasarkan Nilai Rapor dan Kedisiplinan dengan Metode K-Nearest Neighbor,” J. Ilmu Komput. dan Sist. Inf., vol. 7, no. 1, pp. 193–202, 2024, doi: https://doi.org/10.55338/jikomsi.v7i1.2865.
A. M. Husein and R. E. H. Hutauruk, “Penerapan Algoritma C4.5 Dalam Pemilihan Siswa Berprestasi di SMPN 10 Medan,” Digit. Transform. Technol., vol. 2, no. 1, pp. 8–11, 2022, doi: https://doi.org/10.47709/digitech.v2i1.1768.
S. Apandi, “Pemodelan Klasifikasi Siswa Berprestasi dengan Random Forest : Studi Kasus pada Bimbingan Belajar,” Fakt. Exacta, vol. 18, no. 1, pp. 63–71, 2025, doi: https://doi.org/10.30998/faktorexacta.v18i1.27163 ?
H. Amalia, A. Puspita, A. F. Lestari, and Frieyadie, “APPLICATION OF DECISION TREE AND NAIVE BAYES ON STUDENT PERFORMANCE DATASET,” J. Pilar Nusa Mandiri, vol. 18, no. 1, pp. 53–58, 2022, doi: https://doi.org/10.33480/pilar.v18i1.2714.
R. N. J. S.Intam, Wulandari, A. A. N. Risal, and D. F. Surianto, “Klasifikasi Mahasiswa Berprestasi Menggunakan Fuzzy C-Means Dan Naive Bayes,” J. Ilm. Inform. Glob., vol. 15, no. 1, pp. 9–16, 2024, doi: https://doi.org/10.36982/jiig.v15i1.3666.
P. Ramadhan, Yuhandri, and J. Veri, “Eksplorasi Algoritma Decision Tree untuk Penentuan Siswa Berprestasi,” J. Bit-Tech, vol. 7, no. 3, pp. 826–833, 2025, doi: https://doi.org/10.32877/bt.v7i3.2210.
G. M. Agung, R. A. Zuama, and E. S. Budi, “Analysis of Student Academic Performance Using Random Forest and Support Vector Machines,” Comput. Sci., vol. 6, no. 1, pp. 57–65, 2026, doi: https://doi.org/10.31294/co-science.v6i1.10123.
S. Zawiyah, Lailatul Qodriyah, and M. B. Tamam, “Klasifikasi Prestasi Akademik Mahasiswa Menggunakan Metode Random Forest,” J. Digit. Bus. Inf. Technol. Klasifikasi, vol. 1, no. 2, pp. 61–71, 2024, doi: 10.23971/jobit.v1i2.317.
Y. Y. Asyel, R. S. Mokodompit, J. Ligouw, and A. Yusupa, “Meningkatkan Prestasi Akademik Mahasiswa Teknik Informatika UNSRAT Melalui Optimasi Pembelajaran dengan Random Forest,” J. Mhs. Tek. Inform., vol. 4, no. 1, pp. 201–209, 2025, doi: https://doi.org/10.35473/jamastika.v4i1.3940.
R. Fitriani, A. P. Windarto, and I. Gunawan, “Penerapan Algoritma Naive Bayes untuk Klasifikasi Tingkat Pemahaman Siswa pada Pembelajaran Daring,” J. Media Inform. Budidarma, vol. 6, no. 2, pp. 1040–1047, 2022, doi: https://doi.org/10.30865/mib.v6i2.4001.
E. Amos and Y. Nataliani, “Analisis Pengelompokan Data Nilai Siswa untuk Menentukan Siswa Berprestasi Menggunakan Metode Clustering K-Means,” J. Inf. Syst. Informatics, vol. 3, no. 3, pp. 408–419, 2021, doi: https://doi.org/10.51519/journalisi.v3i3.164.
Selipuri, R. F. Purnomo, and Y. Yuniarthe, “Penerapan Algoritma C4.5 untuk Klasifikasi Tingkat Kedisiplinan Siswa,” J. Informatics, Electr. Electron. Eng., vol. 5, no. 1, pp. 33–40, 2024, doi: https://doi.org/10.47065/jieee.v5i1.2630.
B. Q. Husaini and Jemakmun, “Penerapan Algoritma Decision Tree C4.5 untuk Klasifikasi Penjurusan Siswa,” J. Teknol. Inform. dan Komputer2, vol. 9, no. 1, pp. 55–62, 2023, doi: https://doi.org/10.37012/jtik.v9i1.1512.
A. Suciko, Y. Hendriyani, K. Budayawan, and Syafrijon, “Penerapan Data Mining Untuk Klasifikasi Calon Siswa Penerima Program Indonesia Pintar (PIP) Menggunakan Algoritma Naive Bayes,” J. Pendidik. Tambusai, vol. 9, no. 2, pp. 15266–15274, 2023, doi: https://doi.org/10.31004/jptam.v9i2.27930.
M. Nachouki and M. A. Naaj, “Predicting Student Performance to Improve Academic Advising Using the Random Forest Algorithm,” Int. J. Acad. Res. Bus. Soc. Sci. Educ. Technol., vol. 20, no. 1, pp. 1–17, 2022, doi: 10.4018/IJDET.296702.
Mahyudi, Endaryono, and R. Ristiawan, “Predicting Student Final Grades Using Random Forest Algorithms and Linear Regression,” J. Sist. Cerdas, vol. 8, no. 3, pp. 441–448, 2025, doi: https://doi.org/10.37396/jsc.v8i3.618.
D. Kurniasari, R. N. Hidayah, Notiragayu, Warsono, and R. K. Nisa, “CLASSIFICATION MODELS FOR ACADEMIC PERFORMANCE: A COMPARATIVE STUDY OF NAÏVE BAYES AND RANDOM FOREST ALGORITHMS IN ANALYZING UNIVERSITY OF LAMPUNG STUDENT GRADES,” J. Tek. Inform., vol. 5, no. 5, pp. 1267–1276, 2024, doi: https://doi.org/10.52436/1.jutif.2024.5.5.2066.
S. Sivakumar and S. Venkataraman, “Evaluating Machine Learning Approaches: A Comparative Study of Random Forest and Neural Networks in Grade Classification,” Indones. J. Data Sci., vol. 6, no. 1, pp. 73–80, 2025, doi: https://doi.org/10.56705/ijodas.v6i1.240.
V. N. Wijayaningrum, A. P. Kirana, and I. K. Putri, “STUDENT ACADEMIC PERFORMANCE PREDICTION FRAMEWORK WITH FEATURE SELECTION AND IMBALANCED DATA HANDLING,” J. Ilm. Kursor, vol. 12, no. 3, pp. 10–18, 2024, doi: https://doi.org/10.21107/kursor.v12i3.356.
M. Gusnina, Wiharto, and U. Salamah, “Student Performance Prediction in Sebelas Maret University Based on the Random Forest Algorithm,” Int. Inf. Eng. Technol. Assoc., vol. 27, no. 3, pp. 495–501, 2022, doi: https://doi.org/10.18280/isi.270317.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Klasifikasi Siswa Berprestasi Berdasarkan Nilai Akademik dan Non-Akademik dengan Menggunakan Metode Random Forest
Pages: 744-753
Copyright (c) 2026 Ricky Gunawan, Yusuf Ramdhan Nasution

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).






















