Stacking Ensemble Machine Learning for Predicting Scholarship Selection Success: A Case Study of the Kominfo Scholarship Program
DOI:
https://doi.org/10.56873/jitu.8.2.6043Keywords:
AUC, decision support system, Ensemble learning; , Machine learning; , Scholarship selection; , SMOTE; , StackingAbstract
Ensemble learning methods, which combine multiple models, have shown superior performance in various prediction tasks by leveraging the strengths of different algorithms. This study presents an application of a stacking ensemble machine learning method to predict the success of applicants in the Kominfo Scholarship program. By utilizing historical administrative data of scholarship applicants, we build a predictive model to identify candidates with a high potential to be selected and successfully complete the sponsored graduate studies. The proposed approach combines multiple base learners in an ensemble, addressing class imbalance with SMOTE oversampling and optimizing model parameters via grid search. The best-performing stacked model (combining Random Forest and XGBoost with a logistic regression meta-learner) achieved an Area Under the ROC Curve (AUC) of 0.93, outperforming individual classifiers. This paper details the data preparation, model building, and evaluation process, and discusses the implications for fair and efficient scholarship selection. The findings demonstrate that the stacking ensemble approach can enhance accuracy and objectivity in candidate selection, ensuring that deserving applicants are identified more reliably compared to conventional methods.
References
[1] B. Komdigi, “PROGRAM BEASISWA KOMDIGI,” BPSDM Komdigi, 2025. https://beasiswa.komdigi.go.id/tentang-kami/
[2] Kementerian Komunikasi dan Informatika, “Kementerian Komunikasi dan Informatika.” Kominfo, Jakarta, 2023. [Online]. Available: https://kominfo.go.id/index.php/content/detail/3415/Kominfo+%3A+Pengguna+Intern. et+di+Indonesia+63+Juta+Orang/0/berita_satker
[3] M. A. Muslim et al., “An Ensemble Stacking Algorithm to Improve Model Accuracy in Bankruptcy Prediction,” Journal of Data Science and Intelligent Systems, vol. 2, no. 2, pp. 79–86, 2023, doi: 10.47852/bonviewjdsis3202655.
[4] S. Yunita and V. N. Alaeyda, “Penerapan Algoritma C4.5 Untuk Prediksi Penerimaan Beasiswa di SD 4 Pelangsian,” ICIT J., vol. 8, no. 2, pp. 181–193, 2022, doi: 10.33050/icit.v8i2.2408.
[5] B. Kanwal, R. S. Shoukat, S. Ur Rehman, M. Kundi, T. Alsaedi, and A. Alahmadi, “A New Framework for Scholarship Predictor Using a Machine Learning Approach,” Intelligent Automation & Soft Computing, vol. 39, no. 5, pp. 829–854, 2024, doi: 10.32604/iasc.2024.054645.
[6] M. H. D. M. Ribeiro, R. G. da Silva, J. H. K. Larcher, A. Mendes, V. C. Mariani, and L. dos S. Coelho, “Decoding Electroencephalography Signal Response by Stacking Ensemble Learning and Adaptive Differential Evolution,” Sensors, vol. 23, no. 16, pp. 1–22, 2023, doi: 10.3390/s23167049.
[7] M. Lu et al., “A Stacking Ensemble Model of Various Machine Learning Models for Daily Runoff Forecasting,” Water (Switzerland), vol. 15, no. 7, 2023, doi: 10.3390/w15071265.
[8] I. M. Alkhawaldeh, I. Albalkhi, and A. J. Naswhan, “Challenges and limitations of synthetic minority oversampling techniques in machine learning,” World Journal of Methodology., vol. 13, no. 5, pp. 373–378, 2023, doi: 10.5662/wjm.v13.i5.373.
[9] Y. Yang, H. A. Khorshidi, and U. Aickelin, “A review on over-sampling techniques in classification of multi-class imbalanced datasets: insights for medical problems,” Frontiers in Digital Health., vol. 6, no. July, 2024, doi: 10.3389/fdgth.2024.1430245.
[10] Z. Yousefi, A. A. Alesheikh, A. Jafari, S. Torktatari, and M. Sharif, “Stacking Ensemble Technique Using Optimized Machine Learning Models with Boruta–XGBoost Feature Selection for Landslide Susceptibility Mapping: A Case of Kermanshah Province, Iran,” Information, vol. 15, no. 11, 2024, doi: 10.3390/info15110689.
[11] R. Setiawan, A. Latifah, and W. Dwi Lestari, “Rancang Bangun Sistem Informasi Penentu Calon Penerima Beasiswa pada Fakultas Ekonomi Universitas Garut,” Jurnal Algoritma., vol. 19, no. 2, pp. 712–721, 2022, doi: 10.33364/algoritma/v.19-2.1195.
[12] R. Sovia, E. P. W. Mandala, and S. Mardhiah, “Algoritma K-Means dalam Pemilihan Siswa Berprestasi dan Metode SAW untuk Prediksi Penerima Beasiswa Berprestasi,” Jurnal Edukasi dan Penelitian Informatika., vol. 6, no. 2, p. 181, 2020, doi: 10.26418/jp.v6i2.37759.
[13] V. Q. Tran, Y. Choi, and H. Byeon, “Explainable stacking ensemble with feature tokenizer transformers for men’s diabetes prediction,” Journal of Men's Health, vol. 20, no. 11, pp. 38–56, 2024, doi: 10.22514/jomh.2024.184.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Journal of Information Technology and its Utilization
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
The proposed policy for journals that offer open access
Authors who publish with this journal agree to the following terms:
- Copyright on any article is retained by the author(s).
- Author grant the journal, right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement 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 acknowledgement 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.
- The article and any associated published material is distributed under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
