A Comparative Analysis of Different Machine Learning Algorithms Developed with Hyperparameter Optimization in the Prediction of Student Academic Success
Machine learning makes significant contributions in many areas of the applied sciences. One of these is the field of education, in the form of predicting students’ academic success and developing educational policies. In this study, two distance and kernel-based methods and eight tree-based and ense...
Saved in:
Published in | Applied sciences Vol. 15; no. 11; p. 5879 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Basel
MDPI AG
01.06.2025
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Machine learning makes significant contributions in many areas of the applied sciences. One of these is the field of education, in the form of predicting students’ academic success and developing educational policies. In this study, two distance and kernel-based methods and eight tree-based and ensemble learning models were used to predict students’ academic success. The data set used in the study includes various variables, such as demographic information, academic information, course participation rates, and activity participation status, for 2392 students. Hyperparameter optimization was performed using genetic algorithm and grid search methods and model accuracy was tested with 10-fold cross-validation. In addition, the performances of all machine learning models were compared, using seventeen metric results for three cases, including results without hyperparameter optimization and determinations after hyperparameter optimization. Subsequent to the analyses performed, it was concluded that the SVR, GBM, and XGBoost methods have both high explanatory power and low error rates in regression problems requiring high accuracy, such as analyses aimed at predicting student success. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 2076-3417 2076-3417 |
DOI: | 10.3390/app15115879 |