Predicting Student Performance to Improve Academic Advising Using the Random Forest Algorithm

Predicting Student Performance to Improve Academic Advising Using the Random Forest Algorithm

Mirna Nachouki, Mahmoud Abou Naaj
Copyright: © 2022 |Pages: 17
DOI: 10.4018/IJDET.296702
Article PDF Download
Open access articles are freely available for download

Abstract

The Covid-19 pandemic constrained higher education institutions to switch to online teaching, which led to major changes in students’ learning behavior, affecting their overall performance. Thus, students’ academic performance needs to be meticulously monitored to help institutions identify students at risk of academic failure, preventing them from dropping out of the program or graduating late. This paper proposes a CGPA Predicting Model (CPM) that detects poor academic performance by predicting their graduation cumulative grade point average (CGPA). The proposed model uses a two-layer process that provides students with an estimated final CGPA, given their progress in second- and third-year courses. This work allows academic advisors to make suitable remedial arrangements to improve students’ academic performance. Through extensive simulations on a data set related to students registered in undergraduate information technology program gathered over the years, we demonstrate that the CPM attains accurate performance predictions compared to benchmark methods.
Article Preview
Top

Introduction

Student success is one of the main goals of educational institutions. It is measured by academic performance, or the extent to which students meet the standards defined by these institutions. According to Tuckman (1975), student performance refers to observing student knowledge, skills, concepts, understanding, and ideas. In the higher education environment, academic student performance depends on instructors’ and program coordinators’ standards and reflects the achievement of their short- and long-term educational goals (Sundar, 2013).

Prediction of accurate academic student performance in universities is considered an important tool that helps in various decisions related to student admission, retention, graduation, and adapted educational support based on student data observation. Student performance is a significant indicator in measuring institutions’ effectiveness and a crucial factor in students’ future success, particularly in countries’ prosperity. For this reason, higher education institutions focus today on improving student performance and enhancing the quality of their educational programs. An in-depth analysis of the learners’ previous records can play a vital role in providing quality education to learners.

Early prediction of academic student performance helps institutions provide appropriate actions to improve students’ retention and success rates. Educational data mining (EDM) involves analysis and improvement in the prediction methods of student performance. With EDM techniques, researchers can develop prediction models to detect, monitor, and improve student achievement (Alyahyan & Düştegör, 2020).

Predicting academic student performance may also improve curriculum content and plan for adequate academic advising for students. Data mining techniques allow researchers to examine data sets and obtain conclusions that help improve the educational learning process. Various techniques have been applied for this purpose. Machine learning, collaborative filtering, Bayesian networks, artificial neural networks, random forest decision trees, rule-based systems, and correlation analysis have been applied to predict the risk of dropping out of the university, students’ achievement, or grades. All these techniques classify the significant factors that affect and foresee overall student academic performance. However, they differ in precision/accuracy, complexity, and sample data size requirements.

This paper focuses on developing a prediction model of students’ academic performance based on their high school average score and second and third-year grades in a four-year information technology program. It explores the performance of random forest (RF) machine learning in predicting student performance to achieve high predicting accuracy. The proposed methodology proved its worth by achieving accurate results. The result can be used by students, advisors, and program coordinators to reduce education difficulties, improve students’ results, provide better quality education, and develop plans for education policy.

BACKGROUND

Every year, higher education institutions collect large amounts of student data that could be transformed into knowledge, which can help instructors, program coordinators, and policymakers analyze and make adequate decisions. It can also provide timely information to different stakeholders that enhance the quality of their educational processes. Early student performance prediction can help universities provide timely actions, like planning for appropriate training to improve students’ learning experience, thus improving their success rates. In addition, detecting at-risk students early would provide more time for them to improve their performance (Riestra-González et al., 2021).

Academic performance analysis has gained popularity in the past 20 years. Researchers used various prediction and classification methods to provide clues to help students improve their performance and assist educational institutions in improving quality and making better administrative decisions.

Complete Article List

Search this Journal:
Reset
Volume 22: 1 Issue (2024)
Volume 21: 2 Issues (2023)
Volume 20: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 19: 4 Issues (2021)
Volume 18: 4 Issues (2020)
Volume 17: 4 Issues (2019)
Volume 16: 4 Issues (2018)
Volume 15: 4 Issues (2017)
Volume 14: 4 Issues (2016)
Volume 13: 4 Issues (2015)
Volume 12: 4 Issues (2014)
Volume 11: 4 Issues (2013)
Volume 10: 4 Issues (2012)
Volume 9: 4 Issues (2011)
Volume 8: 4 Issues (2010)
Volume 7: 4 Issues (2009)
Volume 6: 4 Issues (2008)
Volume 5: 4 Issues (2007)
Volume 4: 4 Issues (2006)
Volume 3: 4 Issues (2005)
Volume 2: 4 Issues (2004)
Volume 1: 4 Issues (2003)
View Complete Journal Contents Listing