EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Predicting and Comparing Students’ Online and Offline Academic Performance Using Machine Learning Algorithms

Barnabás Holicza iD, Attila Kiss iD

Behavioral Sciences · 28.03.2023 · 13 (4) · 289

DOI: 10.3390/bs13040289 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Behavioral Sciences, online erschienen am 28.03.2023. Verfasst von Barnabás Holicza und 1 weiteren Autor:innen. Beteiligte Einrichtung: Department of Information Systems, ELTE Eötvös Loránd University, 1117 Budapest, Hungary. Die Arbeit wurde bisher 28-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Application Domain Specific Highly Reliable IT Solutions, National Research, Development and Innovation Fund of Hungary, Thematic Excellence Programme TKP2020-…, “Application Domain Specific Highly Reliable IT Solutions” project that has been implemented with the support provided from the National Research, Development…, Thematic Excellence Programme.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Due to COVID-19, the researching of educational data and the improvement of related systems have become increasingly important in recent years. Educational institutions seek more information about their students to find ways to utilize their talents and address their weaknesses. With the emergence of e-learning, researchers and programmers aim to find ways to maintain students’ attention and improve their chances of achieving a higher grade point average (GPA) to gain admission to their desired colleges. In this paper, we predict, test, and provide reasons for declining student performance using various machine learning algorithms, including support vector machine with different kernels, decision tree, random forest, and k-nearest neighbors algorithms. Additionally, we compare two databases, one with data related to online learning and another with data on relevant offline learning properties, to compare predicted weaknesses with metrics such as F1 score and accuracy. However, before applying the algorithms, the databases need normalization to meet the prediction format. Ultimately, we find that success in school is related to habits such as sleep, study time, and screen time. More details regarding the results are provided in this paper.

Schlagwörter

Stichwörter der Autor:innen

decision treee-learningk-nearest neighborsmachine learningrandom foreststudents’ performancesupport vector machine

Autor:innen und Institutionen

  • Department of Information Systems, ELTE Eötvös Loránd University, 1117 Budapest, Hungary.
  • Department of Informatics, János Selye University, 945 01 Komárno, Slovakia.

ORCID-Profile: Barnabás Holicza, Attila Kiss

Förderung

  • Application Domain Specific Highly Reliable IT Solutions, National Research, Development and Innovation Fund of Hungary, Thematic Excellence Programme TKP2020-…
  • “Application Domain Specific Highly Reliable IT Solutions” project that has been implemented with the support provided from the National Research, Development…
  • Thematic Excellence Programme
  • Research & Innovation Operational Programme for the Project: “Support of research and development activities of J. Selye University in the field of Digital…
  • European Regional Development Fund

Zitieren

APA

Holicza, B., & Kiss, A. (2023). Predicting and Comparing Students’ Online and Offline Academic Performance Using Machine Learning Algorithms. Behavioral Sciences, 13(4), 289. https://doi.org/10.3390/bs13040289

Vancouver

Holicza B, Kiss A. Predicting and Comparing Students’ Online and Offline Academic Performance Using Machine Learning Algorithms. Behavioral Sciences. 2023;13(4):289. doi:10.3390/bs13040289

BibTeX
@article{Holicza2023,
  author = {Holicza, Barnabás and Kiss, Attila},
  title = {Predicting and Comparing Students’ Online and Offline Academic Performance Using Machine Learning Algorithms},
  journal = {Behavioral Sciences},
  year = {2023},
  volume = {13},
  number = {4},
  pages = {289},
  doi = {10.3390/bs13040289}
}
Kostenlos starten →