International Journal of
Information and Education Technology

Editor-In-Chief: Prof. Jon-Chao Hong
Frequency: Monthly
ISSN: 2010-3689 (Online)
E-mali: editor@ijiet.org
Publisher: IACSIT Press
 

OPEN ACCESS
3.9
CiteScore

IJIET 2026 Vol.16(10): 2788-2797
doi: 10.18178/ijiet.2026.16.10.2733

Supervised Machine Learning Algorithms for Predicting Academic Specialization: A Comparative Study

Samira Reguragui1,* , Ahmed Bendahmane1 , Abdellatif El Aidi2

  • 1Higher Normal School, Abdelmalek Essaadi University, Tetuan, Morocco
  • 2Faculty of Letters and Human Sciences Sais-Fez, Sidi Mohamed Ben Abdellah University, Fez, Morocco

* Corresponding author

  • Manuscript receivedMarch 6, 2026
  • revisedMay 7, 2026
  • acceptedJuly 3, 2026
  • publishedOctober 26, 2026

Abstract

The choice of a paramedical specialization suited to students’ academic profiles and preferences is a challenge for Moroccan students. To respond to this challenge, this study evaluated seven tree-based algorithms on real data from 889 nursing students from two Moroccan training institutes to determine the best-performing model to predict the students’ paramedical specialization. We implemented Bayesian hyperparameter optimization with Optuna, stratified 5-fold cross-validation, and final evaluation on an independent test set to ensure a robust and reliable evaluation of the models. The resampling techniques (SMOTE, SMOTEENN, ADASYN, SMOTETomek) were applied only in the training folds to avoid data leakage. Ensemble models (Random Forest, Extra Trees, XGBoost, Gradient Boosting, HistGradient Boosting) surpassed the baseline model (Decision Tree), while AdaBoost’s performance remained weak and unstable in cross-validation and on the test set (test macro F1-score as low as 0.1384), confirming its strong sensitivity to resampling-induced noise. On the test set, Random Forest with SMOTEENN achieved the best overall performance (macro F1-score = 0.8836, macro Receiver Operating Characteristic curve and Area Under the Curve (ROC-AUC) = 0.9879, macro Precision-Recall Area Under the Curve (PR-AUC) = 0.9294), whereas XGBoost with SMOTE delivered near-identical predictive performance (macro F1-score = 0.8828) with a faster inference time (0.0060 s), offering the best deployment trade-off. By integrating these two optimal approaches, an orientation system can accurately predict the specialization best suited to a student’s profile and preferences.

Keywords

  • tree-based algorithms
  • SMOTE
  • SMOTEENN
  • ADASYN
  • SMOTETomek
  • class imbalance
  • academic guidance systems
  • classification
  • resampling
  • machine learning algorithms
  • stratified K-fold cross-validation
IJIET-V16N10-2733

How to Cite

Copied

Samira Reguragui, Ahmed Bendahmane, and Abdellatif El Aidi, "Supervised Machine Learning Algorithms for Predicting Academic Specialization: A Comparative Study," International Journal of Information and Education Technology, vol. 16, no. 10, pp. 2788-2797, 2026. https://doi.org/10.18178/ijiet.2026.16.10.2733

Copyright & License

Copyright © 2026 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu