Predicting Student Success with Heterogeneous Graph Deep Learning and Machine Learning Models

• URL: http://arxiv.org/abs/2601.06729v1
• Date: Sun, 11 Jan 2026 00:46:44 GMT
• Title: Predicting Student Success with Heterogeneous Graph Deep Learning and Machine Learning Models
• Abstract summary: We propose a framework that integrates heterogeneous graph deep learning models to enhance early and continuous student performance prediction.<n>Our approach outperforms top machine learning models by 4.7% in validation F1 score during the critical early 7% of the semester.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Early identification of student success is crucial for enabling timely interventions, reducing dropout rates, and promoting on time graduation. In educational settings, AI powered systems have become essential for predicting student performance due to their advanced analytical capabilities. However, effectively leveraging diverse student data to uncover latent and complex patterns remains a key challenge. While prior studies have explored this area, the potential of dynamic data features and multi category entities has been largely overlooked. To address this gap, we propose a framework that integrates heterogeneous graph deep learning models to enhance early and continuous student performance prediction, using traditional machine learning algorithms for comparison. Our approach employs a graph metapath structure and incorporates dynamic assessment features, which progressively influence the student success prediction task. Experiments on the Open University Learning Analytics (OULA) dataset demonstrate promising results, achieving a 68.6% validation F1 score with only 7% of the semester completed, and reaching up to 89.5% near the semester's end. Our approach outperforms top machine learning models by 4.7% in validation F1 score during the critical early 7% of the semester, underscoring the value of dynamic features and heterogeneous graph representations in student success prediction.

Related papers

• Which CS1 Students Will Fail? Identifying Digital Markers from Learning Analytics in Computer Systems and Architecture Using Weighted Academic Momentum and Interaction Logs [0.0]
  Digital learning platforms generate rich behavioural traces (digital markers) that offer the potential to identify struggling students early.<n>This paper investigates whether a combination of traditional and digital markers can predict failure in a first-year CS1 course.
  arXiv  Detail & Related papers  (2026-07-16T08:32:54Z)
• PersonalAI 2.0: Enhancing knowledge graph traversal/retrieval with planning mechanism for Personalized LLM Agents [53.369140518949656]
  We introduce PersonalAI 2.0 (PAI-2), a novel framework to enhance large language model (LLM) based systems through integration of external knowledge graphs (KG)<n>The proposed approach addresses key limitations of existing Retrieval-Augmented Generation (GraphRAG) methods by incorporating a dynamic, multistage query processing pipeline.<n>We show that use of graph algorithms (e.g. BeamSearch, WaterCircles) gain superior results compared to standard flatten retriever on average 6%, while enabled search plan enhancement mechanism gain 18% boost compared to disabled one by LLM-as-a-Judge across six datasets.
  arXiv  Detail & Related papers  (2026-05-13T13:06:30Z)
• Explainable AI and Machine Learning for Exam-based Student Evaluation: Causal and Predictive Analysis of Socio-academic and Economic Factors [1.2163458046014015]
  Academic performance depends on a multivariable nexus of socio-academic and financial factors.<n>This study investigates these influences to develop effective strategies for optimizing students' CGPA.
  arXiv  Detail & Related papers  (2025-08-01T17:09:49Z)
• SentiDrop: A Multi Modal Machine Learning model for Predicting Dropout in Distance Learning [0.4369550829556578]
  School dropout is a serious problem in distance learning, where early detection is crucial for effective intervention and student perseverance.<n>We introduce a novel model that combines sentiment analysis of student comments using the Bidirectional Representations from Transformers (BERT) model.<n>Our model was tested on unseen data from the next academic year, achieving an accuracy of 84%, compared to 82% for the baseline model.
  arXiv  Detail & Related papers  (2025-07-14T16:04:34Z)
• DASKT: A Dynamic Affect Simulation Method for Knowledge Tracing [51.665582274736785]
  Knowledge Tracing (KT) predicts future performance by students' historical computation, and understanding students' affective states can enhance the effectiveness of KT.<n>We propose Affect Dynamic Knowledge Tracing (DASKT) to explore the impact of various student affective states on their knowledge states.<n>Our research highlights a promising avenue for future studies, focusing on achieving high interpretability and accuracy.
  arXiv  Detail & Related papers  (2025-01-18T10:02:10Z)
• Accurate Multi-Category Student Performance Forecasting at Early Stages of Online Education Using Neural Networks [2.195766695109612]
  This study introduces a novel neural network-based approach capable of accurately predicting student performance.<n>The proposed model predicts outcomes in Distinction, Fail, Pass, and Withdrawn categories.<n>The results indicate that the prediction accuracy of the proposed method is about 25% more than the existing state-of-the-art.
  arXiv  Detail & Related papers  (2024-12-08T13:37:30Z)
• VEDIT: Latent Prediction Architecture For Procedural Video Representation Learning [59.68917139718813]
  We show that a strong off-the-shelf frozen pretrained visual encoder can achieve state-of-the-art (SoTA) performance in forecasting and procedural planning. By conditioning on frozen clip-level embeddings from observed steps to predict the actions of unseen steps, our prediction model is able to learn robust representations for forecasting.
  arXiv  Detail & Related papers  (2024-10-04T14:52:09Z)
• Disentangled Generative Graph Representation Learning [51.59824683232925]
  This paper introduces DiGGR (Disentangled Generative Graph Representation Learning), a self-supervised learning framework. It aims to learn latent disentangled factors and utilize them to guide graph mask modeling. Experiments on 11 public datasets for two different graph learning tasks demonstrate that DiGGR consistently outperforms many previous self-supervised methods.
  arXiv  Detail & Related papers  (2024-08-24T05:13:02Z)
• Dynamic Graph Unlearning: A General and Efficient Post-Processing Method via Gradient Transformation [24.20087360102464]
  We study the dynamic graph unlearning for the first time and propose an effective, efficient, general, and post-processing method to implement DGNN unlearning.<n>Our method has the potential to handle future unlearning requests with significant performance gains.
  arXiv  Detail & Related papers  (2024-05-23T10:26:18Z)
• Robust Learning with Progressive Data Expansion Against Spurious Correlation [65.83104529677234]
  We study the learning process of a two-layer nonlinear convolutional neural network in the presence of spurious features. Our analysis suggests that imbalanced data groups and easily learnable spurious features can lead to the dominance of spurious features during the learning process. We propose a new training algorithm called PDE that efficiently enhances the model's robustness for a better worst-group performance.
  arXiv  Detail & Related papers  (2023-06-08T05:44:06Z)
• GIF: A General Graph Unlearning Strategy via Influence Function [63.52038638220563]
  Graph Influence Function (GIF) is a model-agnostic unlearning method that can efficiently and accurately estimate parameter changes in response to a $epsilon$-mass perturbation in deleted data. We conduct extensive experiments on four representative GNN models and three benchmark datasets to justify GIF's superiority in terms of unlearning efficacy, model utility, and unlearning efficiency.
  arXiv  Detail & Related papers  (2023-04-06T03:02:54Z)
• Predicting student performance using sequence classification with time-based windows [1.5836913530330787]
  We show that accurate predictive models can be built based on sequential patterns derived from students' behavioral data. We present a methodology for capturing temporal aspects in behavioral data and analyze its influence on the predictive performance of the models. The results of our improved sequence classification technique are capable of predicting student performance with high levels of accuracy, reaching 90 percent for course-specific models.
  arXiv  Detail & Related papers  (2022-08-16T13:46:39Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Model-Agnostic Graph Regularization for Few-Shot Learning [60.64531995451357]
  We present a comprehensive study on graph embedded few-shot learning. We introduce a graph regularization approach that allows a deeper understanding of the impact of incorporating graph information between labels. Our approach improves the performance of strong base learners by up to 2% on Mini-ImageNet and 6.7% on ImageNet-FS.
  arXiv  Detail & Related papers  (2021-02-14T05:28:13Z)
• Academic Performance Estimation with Attention-based Graph Convolutional Networks [17.985752744098267]
  Given a student's past data, the task of student's performance prediction is to predict a student's grades in future courses. Traditional methods for student's performance prediction usually neglect the underlying relationships between multiple courses. We propose a novel attention-based graph convolutional networks model for student's performance prediction.
  arXiv  Detail & Related papers  (2019-12-26T23:11:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.