Tri-Branch Convolutional Neural Networks for Top-$k$ Focused Academic
Performance Prediction
- URL: http://arxiv.org/abs/2107.10424v1
- Date: Thu, 22 Jul 2021 02:35:36 GMT
- Title: Tri-Branch Convolutional Neural Networks for Top-$k$ Focused Academic
Performance Prediction
- Authors: Chaoran Cui, Jian Zong, Yuling Ma, Xinhua Wang, Lei Guo, Meng Chen,
Yilong Yin
- Abstract summary: Academic performance prediction aims to leverage student-related information to predict their future academic outcomes.
In this paper, we analyze students' daily behavior trajectories, which can be comprehensively tracked with campus smartcard records.
We propose a novel Tri-Branch CNN architecture, which is equipped with row-wise, column-wise, and depth-wise convolution and attention operations.
- Score: 28.383922154797315
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Academic performance prediction aims to leverage student-related information
to predict their future academic outcomes, which is beneficial to numerous
educational applications, such as personalized teaching and academic early
warning. In this paper, we address the problem by analyzing students' daily
behavior trajectories, which can be comprehensively tracked with campus
smartcard records. Different from previous studies, we propose a novel
Tri-Branch CNN architecture, which is equipped with row-wise, column-wise, and
depth-wise convolution and attention operations, to capture the characteristics
of persistence, regularity, and temporal distribution of student behavior in an
end-to-end manner, respectively. Also, we cast academic performance prediction
as a top-$k$ ranking problem, and introduce a top-$k$ focused loss to ensure
the accuracy of identifying academically at-risk students. Extensive
experiments were carried out on a large-scale real-world dataset, and we show
that our approach substantially outperforms recently proposed methods for
academic performance prediction. For the sake of reproducibility, our codes
have been released at
https://github.com/ZongJ1111/Academic-Performance-Prediction.
Related papers
- Learning-Augmented Algorithms with Explicit Predictors [67.02156211760415]
Recent advances in algorithmic design show how to utilize predictions obtained by machine learning models from past and present data.
Prior research in this context was focused on a paradigm where the predictor is pre-trained on past data and then used as a black box.
In this work, we unpack the predictor and integrate the learning problem it gives rise for within the algorithmic challenge.
arXiv Detail & Related papers (2024-03-12T08:40:21Z) - Hierarchical Decomposition of Prompt-Based Continual Learning:
Rethinking Obscured Sub-optimality [55.88910947643436]
Self-supervised pre-training is essential for handling vast quantities of unlabeled data in practice.
HiDe-Prompt is an innovative approach that explicitly optimize the hierarchical components with an ensemble of task-specific prompts and statistics.
Our experiments demonstrate the superior performance of HiDe-Prompt and its robustness to pre-training paradigms in continual learning.
arXiv Detail & Related papers (2023-10-11T06:51:46Z) - Enhancing Deep Knowledge Tracing with Auxiliary Tasks [24.780533765606922]
We propose emphAT-DKT to improve the prediction performance of the original deep knowledge tracing model.
We conduct comprehensive experiments on three real-world educational datasets and compare the proposed approach to both deep sequential KT models and non-sequential models.
arXiv Detail & Related papers (2023-02-14T08:21:37Z) - Understanding Self-Predictive Learning for Reinforcement Learning [61.62067048348786]
We study the learning dynamics of self-predictive learning for reinforcement learning.
We propose a novel self-predictive algorithm that learns two representations simultaneously.
arXiv Detail & Related papers (2022-12-06T20:43:37Z) - AdAUC: End-to-end Adversarial AUC Optimization Against Long-tail
Problems [102.95119281306893]
We present an early trial to explore adversarial training methods to optimize AUC.
We reformulate the AUC optimization problem as a saddle point problem, where the objective becomes an instance-wise function.
Our analysis differs from the existing studies since the algorithm is asked to generate adversarial examples by calculating the gradient of a min-max problem.
arXiv Detail & Related papers (2022-06-24T09:13:39Z) - Non-Clairvoyant Scheduling with Predictions Revisited [77.86290991564829]
In non-clairvoyant scheduling, the task is to find an online strategy for scheduling jobs with a priori unknown processing requirements.
We revisit this well-studied problem in a recently popular learning-augmented setting that integrates (untrusted) predictions in algorithm design.
We show that these predictions have desired properties, admit a natural error measure as well as algorithms with strong performance guarantees.
arXiv Detail & Related papers (2022-02-21T13:18:11Z) - Who will dropout from university? Academic risk prediction based on
interpretable machine learning [0.0]
It predicts academic risk based on the LightGBM model and the interpretable machine learning method of Shapley value.
From the local perspective, the factors affecting academic risk vary from person to person.
arXiv Detail & Related papers (2021-12-02T09:43:31Z) - Jointly Modeling Heterogeneous Student Behaviors and Interactions Among
Multiple Prediction Tasks [35.15654921278549]
Prediction tasks about students have practical significance for both student and college.
In this paper, we focus on modeling heterogeneous behaviors and making multiple predictions together.
We design three motivating behavior prediction tasks based on a real-world dataset collected from a college.
arXiv Detail & Related papers (2021-03-25T02:01:58Z) - EPARS: Early Prediction of At-risk Students with Online and Offline
Learning Behaviors [55.33024245762306]
Early prediction of students at risk (STAR) is an effective and significant means to provide timely intervention for dropout and suicide.
Existing works mostly rely on either online or offline learning behaviors which are not comprehensive enough to capture the whole learning processes.
We propose a novel algorithm (EPARS) that could early predict STAR in a semester by modeling online and offline learning behaviors.
arXiv Detail & Related papers (2020-06-06T12:56:26Z) - 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.