<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "https://jats.nlm.nih.gov/publishing/1.3/JATS-journalpublishing1-3.dtd"><article xml:lang="en" dtd-version="1.3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article"><front><journal-meta><journal-id journal-id-type="issn">2583-6250</journal-id><journal-title-group><journal-title>International Journal of Data Informatics and Intelligent Computing</journal-title><abbrev-journal-title>International Journal of Data Informatics and Intelligent Computing</abbrev-journal-title></journal-title-group><issn pub-type="epub">2583-6250</issn><publisher><publisher-name>Prisma Publications</publisher-name><publisher-loc>India</publisher-loc></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.59461/ijdiic.v5i3.301</article-id><article-categories><subj-group><subject>Machine Learning</subject></subj-group></article-categories><title-group><article-title>Student Academic Risk Classification Using Machine Learning: A Comparative Analysis of Predictive Models</article-title></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">0000-0003-3467-2430</contrib-id><name><surname>Mahadev</surname><given-names>Natesh</given-names></name><address><country>India</country></address><xref ref-type="aff" rid="AFF-1"></xref></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0007-7240-0256</contrib-id><name><surname>L</surname><given-names>Sowmya V.</given-names></name><address><country>India</country></address><xref ref-type="aff" rid="AFF-2"></xref></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">0000-0003-0351-312X</contrib-id><name><surname>Premkumar</surname><given-names>Anitha</given-names></name><address><country>India</country><email>p.anitha@manipal.edu</email></address><xref ref-type="aff" rid="AFF-3"></xref><xref rid="cor-2" ref-type="corresp"></xref></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-6638-1262</contrib-id><name><surname>Thangarasu</surname><given-names>N.</given-names></name><address><country>India</country></address><xref rid="AFF-4" ref-type="aff"></xref></contrib></contrib-group><contrib-group><contrib contrib-type="editor"><name><surname>Natarajan</surname><given-names>Rajesh</given-names></name><address><country>Oman</country></address><xref ref-type="aff" rid="EDITOR-AFF-1"></xref></contrib></contrib-group><aff id="AFF-1">Department of Computer Science and Engineering, Vidyavardhaka College of Engineering, Mysore, Karnataka, India</aff><aff id="AFF-2">Department of Artificial Intelligence and Machine Learning, BMS Institute of Technology &amp; Management, Bengaluru, 560119, India</aff><aff id="AFF-3"><institution content-type="dept">Manipal Institute of Technology Bengaluru</institution><institution-wrap><institution>Manipal Academy of Higher Education</institution><institution-id institution-id-type="ror">https://ror.org/02xzytt36</institution-id></institution-wrap><addr-line>Manipal</addr-line><country country="IN">India</country></aff><aff id="AFF-4"><institution content-type="dept">Department of Computer Science</institution><institution-wrap><institution>Karpagam Academy of Higher Education</institution><institution-id institution-id-type="ror">https://ror.org/00ssvzv66</institution-id></institution-wrap><addr-line>Coimbatore-21</addr-line><country country="IN">India</country></aff><aff id="EDITOR-AFF-1">UTAS-shinas</aff><author-notes><fn fn-type="coi-statement"><label>Conflict of Interest</label><p>The authors declare that they have no conflict of interest.</p></fn><corresp id="cor-2">Corresponding author: Anitha Premkumar, Manipal Institute of Technology Bengaluru, Manipal Academy of Higher Education, Manipal, India.  Email: <email>p.anitha@manipal.edu</email></corresp></author-notes><pub-date iso-8601-date="2026-9-20" publication-format="electronic" date-type="pub"><day>20</day><month>9</month><year>2026</year></pub-date><pub-date iso-8601-date="2026-9-25" publication-format="electronic" date-type="collection"><day>25</day><month>9</month><year>2026</year></pub-date><volume>5</volume><issue>3</issue><fpage>67</fpage><lpage>77</lpage><history><date date-type="received" iso-8601-date="2026-7-4"><day>4</day><month>7</month><year>2026</year></date><date date-type="rev-recd" iso-8601-date="2026-8-25"><day>25</day><month>8</month><year>2026</year></date><date date-type="accepted" iso-8601-date="2026-9-14"><day>14</day><month>9</month><year>2026</year></date></history><permissions><copyright-statement>Copyright (c) 2026 Natesh Mahadev, Sowmya V. L, Anitha Premkumar, N. Thangarasu</copyright-statement><copyright-year>2026</copyright-year><copyright-holder>Natesh Mahadev, Sowmya V. L, Anitha Premkumar, N. Thangarasu</copyright-holder><license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by-sa/4.0/"><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-sa/4.0/</ali:license_ref><license-p>This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.</license-p></license></permissions><self-uri xlink:href="https://ijdiic.com/research/article/view/301" xlink:title="Student Academic Risk Classification Using Machine Learning: A Comparative Analysis of Predictive Models">Student Academic Risk Classification Using Machine Learning: A Comparative Analysis of Predictive Models</self-uri><abstract><p>There are systems in place to identify at-risk students in educational facilities, however early identification allows for more effective support to be allocated. This research presents a framework to identify students at risk in a tertiary institution using contextual, behavioral and academic data. The framework uses a supervised machine learning approach to classify students as Safe, At-Risk or High-Risk. Eight different classification models were trained and evaluated using five-fold cross-validation. The classification performance of the models was analyzed using accuracy, precision, recall and the F1-score. Discrimination analysis was conducted to evaluate the difference in classification. Of the eight classification models, the support vector classifier (SVC) and Logistic Regression model outperformed the others with the SVC achieving 93.63% accuracy. The classification models demonstrated a preference to overfit on the training data. A feature importance analysis was performed to identify the most influential features to the classification models. Some of the more influential features to the classification of risk included students’ previous academic performance and attendance. Based on the results, support systems to identify at-risk students academically can be designed and implemented.</p></abstract><kwd-group><kwd>Student Academic Risk</kwd><kwd>Machine Learning</kwd><kwd>Educational Data Mining</kwd><kwd>Student Performance Prediction</kwd><kwd>Risk Classification</kwd><kwd>Academic Analytics</kwd></kwd-group><custom-meta-group><custom-meta><meta-name>File created by JATS Editor</meta-name><meta-value><ext-link xlink:title="JATS Editor" ext-link-type="uri" xlink:href="https://jatseditor.com">JATS Editor</ext-link></meta-value></custom-meta><custom-meta><meta-name>issue-created-year</meta-name><meta-value>2026</meta-value></custom-meta></custom-meta-group></article-meta></front><body><sec><title>1. INTRODUCTION</title><p>The multiple dimensions of student academic performance include: engagement and participation in the learning process, the student’s previous academic performance and behavior, how the student studies, and the environment in which the student engages in the learning process. Identifying students at risk of underachieving academically enables educational institutions to prepare and implement timely and effective interventions to support the students. Traditional methods of identifying at-risk students mainly depend on teachers’ observations and students’ academic performance and records, and they often lead to the identification of students at risk at a late stage. It is for this reason that several researchers have focused on predicting students’ academic performance using data science and other allied fields.</p><p>Educational Analytics combines multiple dimensions of students’ performance in ways that Academic Performance, Behavioral, and Social-Emotional dimensions of students had not been previously integrated. Prediction of students’ performance and achievement in the field of Educational Data Mining has gained increased attention, despite challenges of applying and adapting it to different educational situations. It has also focused on refining methods of classification and risk prediction. Studies have documented the use of varying datasets and different techniques in academic performance and achievement prediction. These studies have shown the need for further and more methodical studies in the field.</p><p>The current study explores student characteristics related to different components of the learning process and environment. Factors such as attendance, study hours, and completion of assignments reflect the level of participation and engagement in the learning process. Past grades and failures describe past learning experiences. Other variables included in this study describe the family situation and social environment of a student. These variables describe the student’s context and environment and could be associated with learning opportunities and academic achievements.</p><p>Academic risk is defined as the probability of not achieving academic goals and standards. For this study, academic risk is considered at three levels: safe, at-risk, and high-risk. Traditionally, the term ‘academic risk’ is used to describe students who failed or dropped out of a course. Other students with less severe academic concerns are often unrecognized. In the field of early-warning research, the use of machine learning in recognizing at-risk students has gained popularity, and the focus has shifted to the timely implementation of remedial measures <xref rid="BIBR-1" ref-type="bibr">[1]</xref>. Given the variability in the student data, the statistics and data analysis should take this into account. Both numerical and categorical variables were reported in the student data. To use the variables in classification, certain data transformations are required. In the current study, categorical variables were converted to numerical values. Numerical variables were analyzed after replacing missing values and standardizing the values.</p><p>The study investigates several learning strategies using Logistic Regression, Gaussian Naive Bayes, SVC, KNN, Decision Tree, Extra Trees, Random Forest, and Bagging. Different classification behaviors are analyzed by various modeling principles, such as classification by a line, classification by probability, classification by similarity, and classification by a tree. This provides an opportunity to analyze classification behavior without distinguishing the principles of data processing. This kind of analysis is important, since no ML algorithm has been shown to be clearly dominant in the field of educational data prediction <xref ref-type="bibr" rid="BIBR-2">[2]</xref>. To assess models, several methods have been used, such as classification by a line, by probability, and by a tree. Moreover, to evaluate classification behavior, an analysis of classification by a tree was done using a one-against-the-rest approach. To gain a deep understanding of classification behavior, other methods such as a five-fold cross-validation and analysis of accuracy, precision, recall, and F1-score were performed.</p><p>Because classification results should be explained by a human, the influence of each feature on the classification result was analyzed. Interpreting the results allows teachers to better understand the reasoning for classification and provide suggestions for improving student learning <xref ref-type="bibr" rid="BIBR-3">[3]</xref>. For this research, feature importance was analyzed to improve understanding of the classification of academic risk. While there are studies that explore the use of ML to predict academic performance and dropout using different terminologies and frameworks, there are very few studies that use a unified framework for the classification of academic risk to include behavioral and contextual factors to identify Safe, At-Risk, and High-Risk students. The current study proposes and implements a comprehensive machine learning framework to classify levels of academic risk and to identify characteristics of students based on that classification.</p><p>The problem statement can be addressed as follows:</p><list list-type="bullet"><list-item><p>Classify students as Safe, At-Risk, or High-Risk.</p></list-item><list-item><p>Determine the variables that led to the classification of students as At-Risk.</p></list-item><list-item><p>Evaluate classification performance using different classification algorithms.</p></list-item><list-item><p>Assess the classification and distinction performance of different classification algorithms.</p></list-item><list-item><p>Determine the most notable factors that led to the classification of students as at-risk.</p></list-item></list></sec><sec><title>2. RELATED WORK</title><p>There are several applications of ML and EDM to detect at-risk students, including students who experience academic underachievement and students who leave the education system. These studies have assessed and integrated behavioral, social, and demographic factors and employed different classification techniques. Prediction of student dropout and changes in academic status are closely related and have been studied extensively. In one study, the researchers formulated a system to predict student dropout using the integration of different engineering and scientific techniques in ML and responded to class imbalance using SMOTE. Other studies have focused on the integration of different techniques in classification and employed different approaches to address class imbalance and dimensionality. These studies have laid the foundation for the use of data science and integration of different techniques to address class imbalance and other challenges that hinder the identification of at-risk students <xref ref-type="bibr" rid="BIBR-4">[4]</xref>.</p><p>Evaluation of traditional classification techniques has been studied as well. For example, a study evaluated the performance of Decision Trees and Random Forests in predicting students' academic performance <xref rid="BIBR-5" ref-type="bibr">[5]</xref>. The authors suggested that evaluation procedures should be standardized when comparing the performance of different classification techniques. Data balance has been an important consideration for predicting educational outcomes. The effect of SMOTE data augmentation has been studied by <xref ref-type="bibr" rid="BIBR-6">[6]</xref> for a range of educational datasets, and the authors reported that resampling techniques greatly impacted the classification results. Similarly, <xref rid="BIBR-7" ref-type="bibr">[7]</xref> performed classification for predicting secondary school graduation using Logistic Regression, Random Forest, XGBoost, and SVM and reported that implementation details and choices of preprocessing techniques influenced the results significantly. The above-mentioned studies suggest that a combination of appropriate data processing and model selection is critical for developing high-quality educational prediction systems.</p><p>One of the recent advances in the area of educational predictive systems is presented by <xref ref-type="bibr" rid="BIBR-8">[8]</xref>, where the authors proposed an LSTM autoencoder-based framework for educational decision-making. Used a range of classification and regression models for postgraduate students' academic outcome prediction and concluded that the integration of various types of student data (e.g., academic, demographic, and pre-enrollment data) enabled them to capture various types of student performance and behavior. These studies demonstrate the application of predictive learning to capture different educational outcomes using advanced and complex architectures <xref ref-type="bibr" rid="BIBR-9">[9]</xref>.</p><p>Other research focuses on student-related issues of a broader nature and on other methodological issues <xref ref-type="bibr" rid="BIBR-10">[10]</xref>. One study used different ML methods to create models that assess the depression risk of university students using variables related to academics, finance, and social relationships. This study <xref ref-type="bibr" rid="BIBR-11">[11]</xref> illustrates that, with ML, student variables beyond academics can be analyzed. A systematic review focused on prediction studies of various clusters and discussed the challenges of using ML in different institutions. Another study reported that, in the context of ML and educational research, the use of different algorithms for the same task can lead to inconsistent results and, therefore, different conclusions, and this is particularly valid when the performance of the models is analyzed without sufficient justification.</p><p>The same type of ML research focused on prediction of academic performance has been extended to other fields <xref rid="BIBR-12" ref-type="bibr">[12]</xref>. For instance, one study used different ML methods for classification and comparison in the field of finance, and reported that, although the data may be related to different fields, the use of different ML methods can help address the same problem in different ways. Other studies <xref ref-type="bibr" rid="BIBR-13">[13]</xref> have also extended research focused on predicting student dropout to other areas beyond academic performance, and reported the use of ML methods for predictions and integrative, interpretable, and exploratory analyses.</p><p>Research on ML algorithms indicates that no one algorithm covers all territories in the field of education. Research focused on the prediction of academic performance (PAP) is comprehensive, large-scale, and addresses the differences in datasets, algorithms, variables, and metrics <xref ref-type="bibr" rid="BIBR-14">[14]</xref>. Other studies in the area of PAP address the balance and outliers in the samples. Research on predicting academic achievement and dropout focuses on varying algorithms, which cover different frames of the educational domain <xref ref-type="bibr" rid="BIBR-15">[15]</xref>. Likewise, research in predicting academic performance and dropout concentrates on the variability of the algorithms and addresses the scarcity and imbalance in the samples, using multiple classifiers and the majority voting scheme <xref ref-type="bibr" rid="BIBR-16">[16]</xref>.</p><p>Predicting student multilevel academic risk is not extensively studied, and literature focusing on other academic outcome risks, including underachievement, is even more scarce. Most studies focus on predicting academic outcome risks, student under- and overachievement, failures, and student dropout. The reasons for student underachievement may vary at different levels and may include the student’s academic, behavioral, and social contextual conditions. Most of the works address the variability of student outcome risks by focusing on student achievement, behavior, underachievement, and dropout. This is done by exploiting the differentiability and plasticity of ML algorithms, and typically there is little to no concern for the interpretability of the models.</p><p>This study aims to build upon previous research by creating a more nuanced academic risk classification framework. The framework will consist of three classes: safe, at risk, and high risk. The study will gather and analyze data based on traditional academic indicators as well as behavioral and contextual data. The study will use standard machine learning (ML) classifiers after adjusting and selecting the most relevant features. The study aims to gain a comprehensive understanding of each classifier by using cross-validation and alternative assessments of model behavior. To extract the features most relevant to risk classification, the study will assess and evaluate the features in relation to risk classification. Overall, the goal of this study is to comprehensively assess and analyze risk in the academic context as opposed to predicting or explaining a single outcome (i.e., dropout).</p></sec><sec><title>3. METHOD</title><p>This study presents a machine learning model for labeling students as At-Risk, High-Risk, or Safe. The model development process consisted of several steps, including data preparation, transformation, model building, and testing. The complete process is illustrated in Figure <xref ref-type="fig" rid="figure-1">1</xref>.</p><fig id="figure-1" ignoredToc=""><label>Figure 1</label><caption><p>Proposed Machine Learning Framework for Student Academic-Risk Classification</p></caption><graphic mime-subtype="png" mimetype="image" xlink:href="https://ijdiic.com/research/article/download/301/version/302/230/2228/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-3-67-g1.png"><alt-text>Image</alt-text></graphic></fig><sec><title>3.1. Dataset and Data Preprocessing</title><p>The dataset used in this study has 100,000 records. It contains 10 predictors and 1 response variable. The predictors are attendance, study hours, past failures, assignment completion, parental education, family income, extracurricular activities, internet access, previous grade, and final grade. The response variable is risk category, which consists of At-Risk, High-Risk, and Safe. The data were initially screened for errors, and it was discovered that some students were missing values for attendance and study hours. Median imputation was performed for the predictors containing numerical values. For a numerical variable X<sub>j</sub>, if the value was missing, it was replaced with the median of all the values of X<sub>j</sub> using Equation (1).</p><p><inline-formula><tex-math id="math-1"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle Xij∗​=⎨⎧​Xij​,Xij​ is available,median(Xj​),​Xij​ is missing. \end{document} ]]></tex-math></inline-formula>   (1)</p><p>Equation (1) shows that if the value is not available, it will be replaced with the median of all the available values. After the value was imputed, no observations were found to be missing. The categorical variables were represented numerically based on the frequency of each value using Equation (2).</p><p><inline-formula><tex-math id="math-2"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f\left( c \right) = \sum_{i = 1}^{N}I\left( x_{i} = c \right) \end{document} ]]></tex-math></inline-formula>    (2)</p><p>Equation (2) shows that the value of a categorical variable is converted to the number of observations having that value. The value of the target variable was converted to numerical values using LabelEncoder, where the value of At-Risk is assigned 0, High-Risk is assigned 1, and Safe is assigned 2. The X  included the ten input variables, and y was the risk class factor.</p></sec><sec><title>3.2. Data Partitioning, Scaling, and Feature Selection</title><p>The course data were divided into training and testing sets using an 80:20 proportion, with random state 42. The training set mean and standard deviation were used to perform feature standardization for the training set and were applied to both the training and testing sets, as shown in equation (3).</p><p><inline-formula><tex-math id="math-3"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle z_{\text{ij}} = \frac{x_{\text{ij}} - \mu_{j}}{\sigma_{j}} \end{document} ]]></tex-math></inline-formula>      (3)</p><p>Where x<sub>ij </sub>is the feature value, μ<sub>j </sub>and σ<sub>j </sub>are the mean and standard deviation of the training set, respectively. Standardizing features in this manner benefits distance and margin classifiers, like KNN and SVM, which rely on those principles to make classifications. Feature selection was performed using the ANOVA F-test and the K Best feature selection technique. The test retained eight features from the training set. The ANOVA test assesses the feature value in relation to the average value of the feature across the categories. Features that have larger F-values indicate greater differentiability across the categories.</p><p><inline-formula><tex-math id="math-4"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F_{j} = \frac{\sum_{k = 1}^{K}n_{k}\left( {\overline{x}}_{\text{jk}} - {\overline{x}}_{j} \right)^{2}/\left( K - 1 \right)}{\sum_{k = 1}^{K}{\sum_{i = 1}^{n_{k}}(}\left. \ x_{\text{ijk}} - {\overline{x}}_{\text{jk}}\left. \ ) \right.\ ^{2}/\left( N - K \right) \right.\ } \end{document} ]]></tex-math></inline-formula>      (4)</p><p>where K is the number of classes, n<sub>k </sub>is the number of observations in class k, <inline-formula><tex-math id="math-5"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle {\overline{x}}_{\text{jk}} \end{document} ]]></tex-math></inline-formula> is the mean of feature j in class k, and <inline-formula><tex-math id="math-6"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle {\overline{x}}_{j} \end{document} ]]></tex-math></inline-formula> is the overall mean. Equation (4) measures the extent to which a feature differs across the risk categories; features with stronger class-separating capability receive larger F-statistics.</p></sec><sec><title>3.3. Best-Performing Classification Model</title><p>A set of eight classification models was developed as part of the experiment. Because the main interest of this study is on the best-performing classifier, the other models are not discussed in detail. The Support Vector Classifier (SVC) is examined in detail, therefore, based on the results of this experiment. Given the large sample size, an SVC with a linear kernel was developed. Such a model finds a separating hyperplane so that the distance from the hyperplane to the closest observation in the training sample is maximized. The decision function, therefore, takes the form.</p><p><inline-formula><tex-math id="math-7"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle f(x)=w^T x+b \end{document} ]]></tex-math></inline-formula>         (5)</p><p>Where w and b are the weight and bias, respectively, and x is the sample vector. A hyperplane is defined by the decision function as shown in equation (5). The objective of the model is to minimize the following function as represented in equation (6).</p><p><inline-formula><tex-math id="math-8"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \min_{\mathbf{w},b,\mathbf{\xi}}\frac{1}{2} \parallel \mathbf{w} \parallel^{2} + C\sum_{i = 1}^{N}\xi_{i} \end{document} ]]></tex-math></inline-formula>         (6)</p><p><inline-formula><tex-math id="math-9"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle y_i (w^T x_i+b)≥1-ξ_i, ξ_i≥0 \end{document} ]]></tex-math></inline-formula>          (7)</p><p>The constraint is satisfied, where y is the class label. Equations (6) and (7) define the margin for the classification function. Equation (6) is the penalty function for classification error. The classification function finds a decision boundary so that the training sample is maximally classified. The function allows for slack in the classification, in which case the variable ξi represents the degree of slack in the classification function. The margin is larger when the function allows for more classification error. In the case of SVC, the margin is defined by the support vectors.</p></sec><sec><title>3.4. Cross-Validation and Performance Evaluation</title><p>The SVC was configured to permit the estimation of classification probability. For the case of multi-class classification, the SVC determines class-discriminant functions and assigns sample classification based on the function. For N observations, classification accuracy was defined as represented in equation (8).</p><p><inline-formula><tex-math id="math-10"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \text{Accuracy} = \frac{1}{N}\sum_{i = 1}^{N}I\left( y_{i} = {\widehat{y}}_{i} \right) \end{document} ]]></tex-math></inline-formula>         (8)</p><p>where y<sub>i</sub> and ŷ<sub>i</sub> denote predicted and actual classes, respectively. Equation (8) calculates the overall classification accuracy with respect to the student population under consideration. For the case of multiclass classification, weighted precision was computed as shown in equation (9) and weighted recall as shown in equation (10).</p><p><inline-formula><tex-math id="math-11"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \text{Precisio}n_{w} = \sum_{k = 1}^{K}\frac{n_{k}}{N}\text{Precisio}n_{k} \end{document} ]]></tex-math></inline-formula>        (9)</p><p><inline-formula><tex-math id="math-12"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \text{Recal}l_{w} = \sum_{k = 1}^{K}\frac{n_{k}}{N}\text{Recal}l_{k} \end{document} ]]></tex-math></inline-formula>         (10)</p><p>In the above equations, n<sub>k</sub> represents the total number of samples belonging to class k. Equations (9) and (10) provide the overall classification performance of the model considering all the classes and respective samples. The weighted F1 score of a class is computed as shown in equation (11).</p><p><inline-formula><tex-math id="math-13"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F1_{w} = \sum_{k = 1}^{K}\frac{n_{k}}{N}\left( \frac{2\text{Precisio}n_{k}\text{Recal}l_{k}}{\text{Precisio}n_{k} + \text{Recal}l_{k}} \right) \end{document} ]]></tex-math></inline-formula>         (11)</p><p>Classification performance of the model is further analyzed using class-specific classification errors, based on 5-fold cross-validation. Further, to evaluate the discrimination of the model across the three risk factors, we have relied on a one-versus-all strategy and reported the macro average value of the resulting ROC curves. Lastly, to validate our classification system, we relied on feature importance to identify strong predictors of student academic risk.</p></sec></sec><sec><title>4. RESULTS AND DISCUSSION</title><p>The experimental analysis is focused on the evaluation of the student academic risk classification framework developed during the course of this research. The evaluation is based on the results of the models across various validation folds. The features selected, which encompassed the student’s academic and behavioral performance as well as contextual features of the learning environment, were also considered. Classification differences between the considered learning approaches were analyzed. Various classification and regression techniques were employed to address the research questions. Classification performance of the developed models was analyzed using confusion matrices and ROC curves. The training and test generalization was also analyzed. The final element of the analysis was to explore the reasons for the academic risk classification. These analyses provided a foundation for the interpretation of the framework and helped identify the blind spots in classification.</p><sec><title>4.1. Confusion Matrix Analysis</title><p>The figures in <xref ref-type="fig" rid="figure-2">2</xref> illustrate the classification predictions of the three classes: At-Risk, High-Risk, and Safe. Each of the matrices has actual class values for a row, and predicted class values for a column. A position on the main diagonal of the matrix indicates that classification was correct. All off-diagonal elements represent classification errors. It is evident from the matrices that the models were able to classify At-Risk and Safe class values with minimal error. The errors occurred mainly in the classification of the High-Risk class values. It is evident from the matrices that the SVC and Logistic Regression models illustrated the best results, as they had the higher concentration of values on the main diagonal. Relatively higher off-diagonal values were observed for K-Nearest Neighbors and Extra Tree models. Figure <xref ref-type="fig" rid="figure-2">2</xref> illustrates the prediction behavior of the models for the different risk class values and the errors that occur in the classification.</p><fig id="figure-2" ignoredToc=""><label>Figure 2</label><caption><p>Evaluated ML Classifiers for Student Academic Risk Classification: Confusion Matrices</p></caption><graphic xlink:href="https://ijdiic.com/research/article/download/301/version/302/230/2229/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-3-67-g2.png" mime-subtype="png" mimetype="image"><alt-text>Image</alt-text></graphic></fig></sec><sec><title>4.2. Performance Comparison</title><p>Figure <xref ref-type="fig" rid="figure-3">3</xref> shows the assessment of the eight classifiers based on accuracy, precision, recall, and F1 score. The Support Vector Classifier (SVC) showed the best performance out of all the classifiers, with an accuracy of 93.63%, precision of 93.64%, recall of 93.63%, and F1 score of 93.63%. Logistic Regression performed second best and had a score of 93.62% for accuracy, recall, and F1 score, and a precision of 93.63%. Random Forest and Bagging performed at approximately 91% for each of the four performance metrics, and K-Nearest Neighbors (K-NN) performed at 87.21% accuracy and recall, with 87.35% and 87.2 precision and F1 score. The Decision Tree Classifier performed at 85.3% for all four metrics. The Naive Bayes Classifier performed at 80.37% for each of the four metrics. Extra Tree performed at 77.67% for each of the four metrics. The classifiers were evaluated based on predictive performance.</p><fig ignoredToc="" id="figure-3"><label>Figure 3</label><caption><p>Comparative Performance of Machine Learning Classifiers</p></caption><graphic mime-subtype="png" mimetype="image" xlink:href="https://ijdiic.com/research/article/download/301/version/302/230/2230/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-3-67-g3.png"><alt-text>Image</alt-text></graphic></fig></sec><sec><title>4.3. Multiclass ROC-AUC Analysis</title><p>Macro-average ROC curves and the corresponding AUCs are shown in Figure <xref rid="figure-4" ref-type="fig">4</xref>. The best discrimination of the classifiers is shown by the SVC and Logistic Regression classifiers, with an AUC of 0.993. Random Forest and Bagging classifiers have an AUC of 0.987, followed by K-Nearest Neighbors at 0.965. The rest of the classifiers have an AUC less than 0.9. Gaussian Naive Bayes has the lowest, at 0.938. The rest of the classifiers have an AUC in the range of 0.89 to 0.837. Discrimination of the classifiers is done by comparing the ROC curves, and based on that, it is shown that SVC and Logistic Regression classifiers, along with Random Forest and Bagging classifiers, are the best, since their ROC curves touch the upper-left region of the graph and are the farthest from the other classifiers.</p><fig id="figure-4" ignoredToc=""><label>Figure 4</label><caption><p>Multiclass ROC Curves of the Evaluated Machine Learning Classifiers</p></caption><graphic mime-subtype="png" mimetype="image" xlink:href="https://ijdiic.com/research/article/download/301/version/302/230/2231/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-3-67-g4.png"><alt-text>Image</alt-text></graphic></fig></sec><sec><title>4.4. Multiclass Precision-Recall Analysis</title><p>Precision and recall scores are determined as follows: for a given class (i.e., low, medium, or high risk), the area under the corresponding precision-recall curve is calculated and referred to as average precision (AP). Figure <xref ref-type="fig" rid="figure-5">5</xref> shows the multiclass precision and recall curves as well as average precisions for the classification models. Based on the average precision, the SVC and Logistic Regression models performed the best (i.e., highest precision and recall scores), followed by the Random Forest and Bagging models. The K-Nearest Neighbors model again performed the worst. As with the ROC analysis, the SVC and Logistic Regression models performed best, followed by the Random Forest and Bagging models. Figure <xref ref-type="fig" rid="figure-5">5</xref> also shows the precision-recall curves for the tree models (i.e., the Decision Tree, Extra Trees, and Gaussian Naive Bayes models). It should be noted that the model performs worse in terms of precision for higher recall.</p><fig id="figure-5" ignoredToc=""><label>Figure 5</label><caption><p>Multiclass Precision–Recall Curves of the Evaluated Machine Learning Classifiers</p></caption><graphic mimetype="image" xlink:href="https://ijdiic.com/research/article/download/301/version/302/230/2232/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-3-67-g5.png" mime-subtype="png"><alt-text>Image</alt-text></graphic></fig></sec><sec><title>4.5. Importance of Features</title><p>Figure <xref ref-type="fig" rid="figure-6">6</xref> illustrates the importance of the various features in the SVC model. The feature importance is determined by the relative change in the classification error when the feature is permuted. The features ‘previous academic performance’ and ‘study behavior’ are of particular importance. Less important are features such as final grade, extracurricular activities, parental education and income, and students’ internet use.</p><fig id="figure-6" ignoredToc=""><label>Figure 6</label><caption><p>Permutation Feature Importance of the Support Vector Classifier</p></caption><graphic mime-subtype="png" mimetype="image" xlink:href="https://ijdiic.com/research/article/download/301/version/302/230/2233/International_Journal_of_Data_Informatics_and_Intelligent_Computing-5-3-67-g6.png"><alt-text>Image</alt-text></graphic></fig></sec><sec><title>4.6. Comparison with Other Studies</title><p>Table <xref ref-type="table" rid="table-1">1</xref> provided in this section places our research within other studies that have utilized ML to forecast student academic risk and performance. Because the other studies used different datasets and defined their target variables and evaluations differently, the case accuracies reported should be interpreted liberally. This study explains academic risk as a three-class problem (at risk, high risk, and safe) and uses different ML classifiers to build a risk classification model. In this regard, the SVC showed the best performance, with an accuracy of 93.63%.</p><table-wrap id="table-1" ignoredToc=""><label>Table 1</label><caption><p>Comparative Analysis of the Present Study with Existing Machine Learning Studies on Student Academic Risk and Performance Prediction</p></caption><table rules="all" frame="box"><thead><tr><th align="left" colspan="1" valign="top"><bold>Study</bold></th><th align="left" colspan="1" valign="top"><bold>Dataset</bold></th><th align="left" colspan="1" valign="top"><bold>Task</bold></th><th align="left" colspan="1" valign="top"><bold>Main Model</bold></th><th align="left" colspan="1" valign="top"><bold>Reported Accuracy</bold></th></tr></thead><tbody><tr><td valign="top" align="left" colspan="1">Chui et al. <xref ref-type="bibr" rid="BIBR-17">[17]</xref></td><td align="left" colspan="1" valign="top">University students, 32,593 records</td><td valign="top" align="left" colspan="1">At-risk student prediction</td><td valign="top" align="left" colspan="1">RTV-SVM</td><td align="left" colspan="1" valign="top">92.2–93.8%</td></tr><tr><td valign="top" align="left" colspan="1">KSA study <xref ref-type="bibr" rid="BIBR-16">[16]</xref></td><td align="left" colspan="1" valign="top">Saudi university students</td><td align="left" colspan="1" valign="top">Academic performance and dropout prediction</td><td valign="top" align="left" colspan="1">Majority Voting</td><td valign="top" align="left" colspan="1">92.7%</td></tr><tr><td colspan="1" valign="top" align="left">Mindanao State University study <xref ref-type="bibr" rid="BIBR-13">[13]</xref></td><td align="left" colspan="1" valign="top">Higher-education students, 482 records</td><td colspan="1" valign="top" align="left">Student retention prediction</td><td valign="top" align="left" colspan="1">XGBoost</td><td valign="top" align="left" colspan="1">90.66%</td></tr><tr><td valign="top" align="left" colspan="1">College Statistics study <xref ref-type="bibr" rid="BIBR-18">[18]</xref></td><td valign="top" align="left" colspan="1">College statistics students</td><td valign="top" align="left" colspan="1">Identification of at-risk students</td><td colspan="1" valign="top" align="left">Random Forest</td><td valign="top" align="left" colspan="1">91%</td></tr><tr><td align="left" colspan="1" valign="top">Present Study</td><td valign="top" align="left" colspan="1">Student Academic Risk Dataset, 100,000 records</td><td align="left" colspan="1" valign="top">Three-class risk classification</td><td colspan="1" valign="top" align="left">SVC</td><td valign="top" align="left" colspan="1">93.63%</td></tr></tbody></table></table-wrap></sec></sec><sec><title>5. CONCLUSION</title><p>The goal of this study was to develop a machine learning framework to classify students as At-Risk, High-Risk, or Safe based on various behavioral and psychological factors, as well as academic data. Eight classifiers were trained and tested using multiple metrics within the same parameter limits. Out of all the models assessed, Support Vector Classifier (SVC) showed the strongest performance, with an accuracy of 93.63%, and corresponding values of precision, recall, and F1 score of 93.64, 93.63, and 93.63, respectively. The assessed models showed variations in their predictive behaviors and in the ways they generalized to unseen data. According to variable importance analyses, predictors of academic risk included, but were not limited to, attendance, study hours, completion of assignments, past grades, and past academic failures. In summary, results revealed that the use of ML techniques to classify academic risk is viable and supports the case for using data to find learners who may benefit from proactive support and intervening before it may be too late. For this research, we will be able to assess the generalizability of our ML framework for academic risk by using extended, real-world, and longitudinal student data from numerous institutions. To further enhance the ML academic risk framework and allow for its broader use, we will integrate Explainable AI and ensure ML models used embody standards of fairness and equality.</p></sec></body><back><sec sec-type="data-availability"><title>Data Availability</title><p>The original data presented in the study are openly available in Kaggle "Student Academic Risk Prediction Dataset", at doi: https://www.kaggle.com/datasets/arpitsharmaml/student-academic-risk-prediction-dataset?resource=download</p></sec><bio><title>Biography</title><p><bold>Natesh Mahadev</bold> Completed his PhD in computer science and engineering in Visveswaraya technological university (VTU), MTech from Visvesvaraya Technological University (VTU), B.E (CSE) from VTU, currently he is working as professor in the department of Computer science and engineering in Vidya vardhaka college of engineering, Mysore, Karnataka, India. His research interests include Digital image processing, Blockchain, Machine learning, Artificial Intelligence, Data science. He has published a various paper in reputed National and international journals. He can be contacted at email: natesh.m@vvce.ac.in</p><p><bold>Sowmya V. L.</bold> is an Assistant Professor in the Department of Artificial Intelligence and Machine Learning at BMS Institute of Technology and Management, Bengaluru, India. She received her Ph.D. in Computer Science and Engineering from Visvesvaraya Technological University, Karnataka, India. Her doctoral research focused on radiogenomics-based approaches in neuro-oncology, integrating radiomics, genomics, and machine learning for computational biomarker discovery and disease characterization. Her research interests include artificial intelligence in healthcare, medical image analysis, radiomics, genomics, bioinformatics, multimodal data integration, and explainable machine learning. She is actively involved in interdisciplinary research aimed at developing computational methodologies for medical diagnosis, disease characterization, and precision medicine. She can be contacted at email: soumyavl@bmsit.in</p><p><bold>Anitha Premkumar</bold> is currently serving as an Assistant Professor (Senior Scale) at the Manipal Institute of Technology Bengaluru. She earned her Ph.D. from the Vellore Institute of Technology, Vellore, Tamil Nadu, India. She has an extensive publication record, with numerous research papers presented at international journals and conferences. Her primary research interests include cloud computing, blockchain, and machine learning. She can be contacted at email: p.anitha@manipal.edu</p><p><bold>N. Thangarasu</bold> is currently working as an assistant professor in the department of Computer Science, at Karpagam Academy of Higher Education, Coimbatore. I am greatly fascinated with the advanced computing technology and research programs is Cluster Computing, Cryptography and Network Security, Cloud Computing, Artificial Intelligent System, Information Security in large Database and Data Mining as well as the strong teaching experience. My doctoral dissertation also focuses on advanced security systems with cloud computing, and I have published more than 80 publications in reputed journals, which I find would be a great addition to the success of your teaching and research   department. He can be contacted at email: drthangarasu.n@kahedu.edu.in</p></bio><ref-list><title>References</title><ref id="BIBR-1"><element-citation publication-type="journal"><article-title>Using machine learning to predict student outcomes for early intervention and formative assessment</article-title><source>Sci Rep</source><volume>15</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Alkan</surname><given-names>B.B.</given-names></name><name><surname>Kuzucuk</surname><given-names>S.</given-names></name><name><surname>Alkan</surname><given-names>N.</given-names></name><name><surname>Sinan</surname><given-names>A.</given-names></name></person-group><year>2025</year><page-range>39797,</page-range><pub-id pub-id-type="doi">10.1038/s41598-025-23409-w</pub-id></element-citation></ref><ref id="BIBR-2"><element-citation publication-type="journal"><article-title>Academic Performance Prediction Using Machine Learning Approaches: A Survey</article-title><source>IEEE Trans Learn Technol</source><volume>18</volume><person-group person-group-type="author"><name><surname>Pan</surname><given-names>J.</given-names></name><name><surname>Zhao</surname><given-names>Z.</given-names></name><name><surname>Han</surname><given-names>D.</given-names></name></person-group><year>2025</year><page-range>351-368,</page-range><pub-id pub-id-type="doi">10.1109/TLT.2025.3554174</pub-id></element-citation></ref><ref id="BIBR-3"><element-citation publication-type="journal"><article-title>Machine learning models for academic performance prediction: interpretability and application in educational decision-making</article-title><source>Front Educ</source><volume>10</volume><person-group person-group-type="author"><name><surname>Guevara-Reyes</surname><given-names>R.</given-names></name><name><surname>Ortiz-Garcés</surname><given-names>I.</given-names></name><name><surname>Andrade</surname><given-names>R.</given-names></name><name><surname>Cox-Riquetti</surname><given-names>F.</given-names></name><name><surname>Villegas-Ch</surname><given-names>W.</given-names></name></person-group><year>2025</year><pub-id pub-id-type="doi">10.3389/feduc.2025.1632315</pub-id></element-citation></ref><ref id="BIBR-4"><element-citation publication-type="journal"><article-title>Early Prediction of Student Dropout Through Machine Learning in Educational Data Mining: A Comparative Analysis of Algorithms and Data Balancing Techniques</article-title><source>Appl Sci</source><volume>16</volume><issue>18</issue><person-group person-group-type="author"><name><surname>Guamán-Hidalgo</surname><given-names>E.</given-names></name><name><surname>Enciso</surname><given-names>L.</given-names></name></person-group><year>2026</year><page-range>8915,</page-range><pub-id pub-id-type="doi">10.3390/app16188915</pub-id></element-citation></ref><ref id="BIBR-5"><element-citation publication-type="conf-paper"><article-title>Assessing the Influence of Video Games on Academic Success Through Machine Learning Techniques</article-title><source>2026 International Conference on Electronics, Communications and Computer Science (ICECCS</source><person-group person-group-type="author"><name><surname>Ladia</surname><given-names>A.R.</given-names></name><name><surname>Caluya</surname><given-names>S.S.</given-names></name></person-group><year>2026</year><fpage>1</fpage><lpage>5</lpage><page-range>1-5</page-range><publisher-name>IEEE</publisher-name><pub-id pub-id-type="doi">10.1109/ICECCS70432.2026.11651272</pub-id></element-citation></ref><ref id="BIBR-6"><element-citation publication-type="journal"><article-title>Enhancing Early Academic Outcome Prediction in Small Educational Datasets Through Data Augmentation Techniques</article-title><source>Data</source><volume>11</volume><issue>7</issue><person-group person-group-type="author"><name><surname>Kafhali</surname><given-names>S.El</given-names></name><name><surname>Hafdi</surname><given-names>Z.S.</given-names></name></person-group><year>2026</year><page-range>161,</page-range><pub-id pub-id-type="doi">10.3390/data11070161</pub-id></element-citation></ref><ref id="BIBR-7"><element-citation publication-type="conf-paper"><article-title>Comparative Analysis of Machine Learning Models for Student Performance Prediction with SHAP- Based Explainability Approach</article-title><source>2026 International Conference on Smart Computing, IoT, and Machine Learning (SIML</source><person-group person-group-type="author"><name><surname>Mulyawan</surname><given-names>Y.S.</given-names></name><name><surname>Rachmatullah</surname><given-names>M.I.C.</given-names></name></person-group><year>2026</year><fpage>1</fpage><lpage>6</lpage><page-range>1-6</page-range><publisher-name>IEEE</publisher-name><pub-id pub-id-type="doi">10.1109/SIML69834.2026.11621106</pub-id></element-citation></ref><ref id="BIBR-8"><element-citation publication-type="journal"><article-title>Modelling of enhanced predictive analytics and decision-making approach using recurrent autoencoder with attribute subset reduction for students’ academic performance</article-title><source>Ain Shams Eng J</source><volume>17</volume><issue>3</issue><person-group person-group-type="author"><name><surname>Altalhi</surname><given-names>A.H.</given-names></name><name><surname>Ragab</surname><given-names>M.</given-names></name></person-group><year>2026</year><page-range>103999,</page-range><pub-id pub-id-type="doi">10.1016/j.asej.2026.103999</pub-id></element-citation></ref><ref id="BIBR-9"><element-citation publication-type="journal"><article-title>Comparison of machine learning classification and regression models for prediction of academic performance among postgraduate public health students</article-title><source>Sci Rep</source><volume>15</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Sayed</surname><given-names>A.F.A.</given-names></name><name><surname>Arafa</surname><given-names>M.A.</given-names></name><name><surname>El-Nimr</surname><given-names>N.A.</given-names></name><name><surname>Banawan</surname><given-names>K.A.S.</given-names></name><name><surname>Abdou</surname><given-names>M.S.</given-names></name></person-group><year>2025</year><page-range>44056,</page-range><pub-id pub-id-type="doi">10.1038/s41598-025-31023-z</pub-id></element-citation></ref><ref id="BIBR-10"><element-citation publication-type="conf-paper"><article-title>A Comparative Analysis of Machine Learning Algorithms for Predicting Depression in Bangladeshi University Students</article-title><source>2025 IEEE 4th International Conference on Robotics, Automation, Artificial-Intelligence and Internet-of-Things (RAAICON</source><person-group person-group-type="author"><name><surname>Alif</surname><given-names>M.A.U.</given-names></name><name><surname>Ahmed</surname><given-names>M.</given-names></name><name><surname>Ali</surname><given-names>M.Y.</given-names></name><name><surname>Shamsi</surname><given-names>R.</given-names></name></person-group><year>2025</year><fpage>760</fpage><lpage>765</lpage><page-range>760-765</page-range><publisher-name>IEEE</publisher-name><pub-id pub-id-type="doi">10.1109/RAAICON69033.2025.11502398</pub-id></element-citation></ref><ref id="BIBR-11"><element-citation publication-type="journal"><article-title>Improve Student Risk Prediction with Clustering Techniques: A Systematic Review in Education Data Mining</article-title><source>Educ Sci</source><volume>15</volume><issue>12</issue><person-group person-group-type="author"><name><surname>Lu</surname><given-names>Y.</given-names></name><name><surname>Yeom</surname><given-names>S.</given-names></name><name><surname>Maktoubian</surname><given-names>J.</given-names></name><name><surname>Rahman</surname><given-names>M.M.</given-names></name><name><surname>Kim</surname><given-names>S.-H.</given-names></name></person-group><year>2025</year><page-range>1695,</page-range><pub-id pub-id-type="doi">10.3390/educsci15121695</pub-id></element-citation></ref><ref id="BIBR-12"><element-citation publication-type="journal"><article-title>Comparative Analysis of the Predictive Risk Assessment Modeling Technique Using Artificial Intelligence</article-title><source>J Electr Eng Technol</source><volume>20</volume><issue>6</issue><person-group person-group-type="author"><name><surname>Tolkynbekova</surname><given-names>A.</given-names></name><name><surname>Koishiyeva</surname><given-names>D.</given-names></name><name><surname>Bissembayev</surname><given-names>A.</given-names></name><name><surname>Mukhammejanova</surname><given-names>D.</given-names></name><name><surname>Mukasheva</surname><given-names>A.</given-names></name><name><surname>Kang</surname><given-names>J.W.</given-names></name></person-group><year>2025</year><page-range>4509-4526,</page-range><pub-id pub-id-type="doi">10.1007/s42835-025-02269-4</pub-id></element-citation></ref><ref id="BIBR-13"><element-citation publication-type="journal"><article-title>Predicting student retention: A comparative study of machine learning approach utilizing sociodemographic and academic factors</article-title><source>Syst Soft Comput</source><volume>7</volume><person-group person-group-type="author"><name><surname>Deleña</surname><given-names>R.D.</given-names></name><etal/></person-group><year>2025</year><page-range>200352,</page-range><pub-id pub-id-type="doi">10.1016/j.sasc.2025.200352</pub-id></element-citation></ref><ref id="BIBR-14"><element-citation publication-type="journal"><article-title>Supervised machine learning algorithms for predicting student dropout and academic success: a comparative study</article-title><source>Discov Artif Intell</source><volume>4</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Villar</surname><given-names>A.</given-names></name><name><surname>Andrade</surname><given-names>C.R.V.</given-names></name></person-group><year>2024</year><page-range>2,</page-range><pub-id pub-id-type="doi">10.1007/s44163-023-00079-z</pub-id></element-citation></ref><ref id="BIBR-15"><element-citation publication-type="conf-paper"><article-title>Comparative Analysis of Machine Learning Algorithms for Predicting Student Academic Performance in Higher Education</article-title><source>2024 4th International Conference on Ubiquitous Computing and Intelligent Information Systems (ICUIS</source><person-group person-group-type="author"><name><surname>Cruz</surname><given-names>M.M.P.</given-names></name><name><surname>Lumauag</surname><given-names>R.G.</given-names></name></person-group><year>2024</year><fpage>888</fpage><lpage>896</lpage><page-range>888-896</page-range><publisher-name>IEEE</publisher-name><pub-id pub-id-type="doi">10.1109/ICUIS64676.2024.10866086</pub-id></element-citation></ref><ref id="BIBR-16"><element-citation publication-type="journal"><article-title>Early prediction of Student academic performance based on Machine Learning algorithms: A case study of bachelor’s degree students in KSA</article-title><source>Educ Inf Technol</source><volume>29</volume><issue>11</issue><person-group person-group-type="author"><name><surname>Said</surname><given-names>M.Ben</given-names></name><name><surname>Kacem</surname><given-names>Y.Hadj</given-names></name><name><surname>Algarni</surname><given-names>A.</given-names></name><name><surname>Masmoudi</surname><given-names>A.</given-names></name></person-group><year>2024</year><page-range>13247-13270,</page-range><pub-id pub-id-type="doi">10.1007/s10639-023-12370-8</pub-id></element-citation></ref><ref id="BIBR-17"><element-citation publication-type="journal"><article-title>Predicting at-risk university students in a virtual learning environment via a machine learning algorithm</article-title><source>Comput Human Behav</source><volume>107</volume><person-group person-group-type="author"><name><surname>Chui</surname><given-names>K.T.</given-names></name><name><surname>Fung</surname><given-names>D.C.L.</given-names></name><name><surname>Lytras</surname><given-names>M.D.</given-names></name><name><surname>Lam</surname><given-names>T.M.</given-names></name></person-group><year>2020</year><page-range>105584,</page-range><pub-id pub-id-type="doi">10.1016/j.chb.2018.06.032</pub-id></element-citation></ref><ref id="BIBR-18"><element-citation publication-type="journal"><article-title>Enhancing Student Success: Early Prediction of Struggles in College Statistics</article-title><source>Scatterplot</source><volume>2</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Wickramasinghe</surname><given-names>I.</given-names></name></person-group><year>2025</year><pub-id pub-id-type="doi">10.1080/29932955.2025.2507457</pub-id></element-citation></ref></ref-list></back></article>