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

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.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-07-12
DOI
https://doi.org/10.5281/zenodo.15870190
Primary Topic
Online Learning and Analytics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Zenodo (CERN European Organization for Nuclear Research)
Online Learning and Analytics
article

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

article en

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.

Zenodo (CERN European Organization for Nuclear Research)
Quality Education
Openalex Percentile: Top 50%
Online Learning and Analytics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.