Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
10.55041/IJSREM38488
Volume:
8 |
11 |
Nov 2024
Pages:
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Recent years have seen a significant increase in study interest in the areas of predicting student performance, avoiding failure, and identifying the variables affecting student dropout. One important indicator in online and open distance learning courses is the student dropout rate. We purpose the naive bayes classification method to construct the student dropout prediction using naive bayes. This work examines the critical topic of forecasting student dropout rates in higher education using machine learning approaches, with a particular emphasis on the random forest algorithm and the naive bayes algorithm. The study’s goal is to properly anticipate dropout rates using data mining methods and machine learning algorithms after conducting a thorough evaluation of existing literature and approaches. The systematic method consists of data collection from a Kaggle dataset, data preparation to solve class imbalance via SMOTE oversampling, and algorithm selection. Random forest and naive Bayes approaches outperform other machine learning algorithms in terms of accuracy, sensitivity, specificity, and precision. The study underscores the importance of considering diverse factors such as demographic data, socioeconomic factors, and academic performance in dropout prediction models. The implications of this research extend beyond academia, with the potential to inform proactive interventions and support systems, ultimately leading to improved student outcomes and institutional effectiveness. According to this paper, the paper outputs that for the binary classification on the data set used in this project has best performed with Naive Bayes and Random Forest Algorithm with SMOTE oversampling.
KEYWORDS
Publication Date
10/10/2024
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
5
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...