Machine Learning-Based Multi-Class Scholarship Classification with a Streamlit Prototype

Authors

  • Siti Nabila Ariza Fitri Telkom University, Indonesia
  • Rona Nisa Sofia Amriza Telkom University, Indonesia
  • M. Yoka Fathoni Telkom University, Indonesia
Pages Icon

DOI:

https://doi.org/10.63158/journalisi.v8i4.1673

Keywords:

Scholarship Classification, Multi-Class Classification, Machine Learning Algorithms, CRISP-DM, Streamlit

Abstract

The scholarship selection process at a private university is still conducted manually by reviewing scholarship applicant documents individually, resulting in a time-consuming process and potential inconsistencies in evaluation. This study aims to develop a multi-class Machine Learning-based classification model to support scholarship classification based on recipient criteria and evaluating model performance using accuracy, precision, recall, F1-score, and confusion matrix metrics. This study applied the Cross-Industry Standard Process for Data Mining (CRISP-DM) framework consisting of six stages Business Understanding, Data Understanding, Data Preparation, Modelling, Evaluation, and Deployment. The dataset consists of 408 historical scholarship recipient records categorized into four scholarship classes. A key contribution of this study is the integration of the CRISP-DM methodology with feature importance analysis using Random Forest Feature Importances, class balancing using SMOTE, and machine learning classifiers, including Random Forest, SVM, and Naïve Bayes, within a unified predictive modelling framework. Based on the evaluation results, the Support Vector Machine algorithm achieved the best performance with an accuracy of 77% and a macro F1-score of 63%, followed by Random Forest at 76% and Naïve Bayes at 70%. The SVM model was then implemented as a Streamlit-based web to support scholarship recommendations and is not intended as a final scholarship approval system. This research contributes to the development of an efficient, data-driven scholarship classification support system for higher education institutions.

Downloads

Download data is not yet available.

References

[1] Y. Yunita, N. Hartono, and Erfina, “Penerapan data mining dalam sistem pendukung keputusan penerimaan beasiswa KIP-Kuliah menggunakan algoritma Naive Bayes,” J. Ilm. Sist. Inf. dan Ilmu Komput., vol. 5, no. 1, pp. 154–175, 2025, doi: 10.55606/juisik.v5i1.1415.

[2] H. Saleh and Hamria, “K-Nearest Neighbor berbasis seleksi atribut Chi Square untuk klasifikasi penerima beasiswa kurang mampu,” Simetris: J. Tek. Mesin, Elektro dan Ilmu Komput., vol. 14, no. 1, pp. 39–48, May 2023, doi: 10.24176/simet.v14i1.9178.

[3] B. R. A. Febrilia, M. H. Yani, and S. Anwar, “Ordinal logistic regression analysis of factors affecting students’ scholarship status in Mataram University,” BAREKENG: J. Ilmu Mat. dan Terap., vol. 14, no. 2, pp. 227–232, Jun. 2020, doi: 10.30598/barekengvol14iss2pp227-232.

[4] S. Grobler, “Quality education in the context of the Sustainable Development Goals: An interpretation model,” Forum Oświatowe, vol. 34, no. 1, pp. 153–164, 2022, doi: 10.34862/fo.2022.11.

[5] United Nations, “Goal 4: Quality education.” Accessed: Aug. 22, 2026. [Online]. Available: United Nations Sustainable Development, Goal 4. Goal 4: Quality Education

[6] N. J. Saputra, “Penerapan algoritma K-Nearest Neighbor untuk klasifikasi penerima beasiswa pada STMIK Widya Cipta Dharma,” B.S. thesis, Program Studi Teknik Informatika, STMIK Widya Cipta Dharma, Samarinda, Indonesia, 2024.

[7] M. Paramesha, S. S. Baba, S. F. Musthafa, V. V. Sai, and S. S. Kiran, “Data-driven scholarship prediction using machine learning for equitable education allocation,” Front. Collab. Res., vol. 2, no. 1S, pp. 43–50, Dec. 2024, doi: 10.70162/fcr/2024/v2/i1/v2i1s06.

[8] C. Romero and S. Ventura, “Educational data mining: A review of the state of the art,” IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 40, no. 6, pp. 601–618, Nov. 2010, doi: 10.1109/TSMCC.2010.2053532.

[9] R. Y. Pradana, F. E. Nastiti, and I. Oktaviani, “Machine learning pengklasifikasikan performa karyawan direct sales force kartu prabayar menggunakan metode Random Forest classifier,” JEKIN: J. Tek. Inform., vol. 4, no. 3, pp. 590–599, Aug. 2024, doi: 10.58794/jekin.v4i3.864.

[10] A. Niarman, Asrida, and A. Adli, “Development of a machine learning-based predictive model for UPZ scholarship recipient selection at UIN Mahmud Yunus Batusangkar,” J. Edik Inform., vol. 11, no. 2, 2025, doi: 10.22202/ei.2025.v11i2.10022.

[11] D. B. Siswanto and D. Normawati, “Sistem klasifikasi monitoring dan evaluasi kelayakan penerima beasiswa UAD menggunakan algoritma Naïve Bayes,” J. Saintekom, vol. 13, no. 2, pp. 161–172, Sep. 2023, doi: 10.33020/saintekom.v13i2.428.

[12] D. Ruswanti, D. Susilo, and R. Riani, “Implementasi CRISP-DM pada data mining untuk melakukan prediksi pendapatan dengan algoritma C4.5,” Go Infotech: J. Ilm. STMIK AUB, vol. 30, no. 1, pp. 111–121, Jun. 2024, doi: 10.36309/goi.v30i1.266.

[13] R. Mukhaimin, R. Ester, and I. T. Hardono, “Optimalisasi business intelligence dengan metode CRISP-DM pada Departemen Service Solution PT Home Center Indonesia,” JRIIN: J. Ris. Inform. dan Inov., vol. 3, no. 5, pp. 1268–1272, 2025.

[14] D. Kurniawan and M. Yasir, “Optimization sentiment analysis using CRISP-DM and Naive Bayes methods implemented on social media,” Cyberspace: J. Pendidik. Teknol. Inf., vol. 6, no. 2, pp. 74–85, Oct. 2022, doi: 10.22373/cj.v6i2.12793.

[15] N. V. Chawla, K. W. Bowyer, L. O. Hall, and W. P. Kegelmeyer, “SMOTE: Synthetic minority over-sampling technique,” J. Artif. Intell. Res., vol. 16, pp. 321–357, Jun. 2002, doi: 10.1613/jair.953.

[16] B. C. Perdana and E. A. Farida, “Komparasi algoritma Decision Tree dan Random Forest dalam prediksi kelayakan mahasiswa penerima beasiswa,” JUSINFO: J. Sist. Inf., vol. 1, no. 1, pp. 19–24, Nov. 2025.

[17] S. Budiman, A. Sunyoto, and A. Nasiri, “Analisa performa penggunaan feature selection untuk mendeteksi intrusion detection systems dengan algoritma Random Forest classifier,” Sistemasi: J. Sist. Inf., vol. 10, no. 3, pp. 754–760, Sep. 2021, doi: 10.32520/stmsi.v10i3.1550.

[18] L. Breiman, “Random forests,” Mach. Learn., vol. 45, no. 1, pp. 5–32, Oct. 2001, doi: 10.1023/A:1010933404324.

[19] N. A. Amalia, I. T. Utami, and Y. Wilandari, “Analisis sentimen kebijakan penyelenggara sistem elektronik lingkup privat menggunakan penalized logistic regression dan Support Vector Machine,” J. Gaussian, vol. 12, no. 4, pp. 560–569, 2023, doi: 10.14710/j.gauss.12.4.560-569.

[20] C. Cortes and V. Vapnik, “Support-vector networks,” Mach. Learn., vol. 20, no. 3, pp. 273–297, Sep. 1995, doi: 10.1007/BF00994018.

[21] R. Blanquero, E. Carrizosa, P. Ramírez-Cobo, and M. R. Sillero-Denamiel, “Variable selection for Naïve Bayes classification,” Comput. Oper. Res., vol. 135, Art. no. 105456, Nov. 2021, doi: 10.1016/j.cor.2021.105456.

[22] M. D. Muafa and L. Iswari, “Pengembangan aplikasi berbasis web dengan RShiny untuk data klasifikasi menggunakan metode Naive Bayes,” Automata, vol. 3, no. 1, pp. 8–15, Jan. 2022.

[23] H. M. Nawawi, A. B. Hikmah, A. Mustopa, and G. Wijaya, “Model klasifikasi machine learning untuk prediksi ketepatan penempatan karir,” J. Saintekom, vol. 14, no. 1, pp. 13–25, Mar. 2024, doi: 10.33020/saintekom.v14i1.512.

Downloads

Published

2026-08-22

Issue

Section

Articles

Most read articles by the same author(s)