Graph-based Ensemble Machine Learning for Student Performance Prediction
- URL: http://arxiv.org/abs/2112.07893v1
- Date: Wed, 15 Dec 2021 05:19:46 GMT
- Title: Graph-based Ensemble Machine Learning for Student Performance Prediction
- Authors: Yinkai Wang, Aowei Ding, Kaiyi Guan, Shixi Wu, Yuanqi Du
- Abstract summary: We propose a graph-based ensemble machine learning method to improve the stability of single machine learning methods.
Our model outperforms the best traditional machine learning algorithms by up to 14.8% in prediction accuracy.
- Score: 0.7874708385247353
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Student performance prediction is a critical research problem to understand
the students' needs, present proper learning opportunities/resources, and
develop the teaching quality. However, traditional machine learning methods
fail to produce stable and accurate prediction results. In this paper, we
propose a graph-based ensemble machine learning method that aims to improve the
stability of single machine learning methods via the consensus of multiple
methods. To be specific, we leverage both supervised prediction methods and
unsupervised clustering methods, build an iterative approach that propagates in
a bipartite graph as well as converges to more stable and accurate prediction
results. Extensive experiments demonstrate the effectiveness of our proposed
method in predicting more accurate student performance. Specifically, our model
outperforms the best traditional machine learning algorithms by up to 14.8% in
prediction accuracy.
Related papers
- Integrating behavior analysis with machine learning to predict online learning performance: A scientometric review and empirical study [6.133369217932887]
This study proposes an integration framework that blends learning behavior analysis with ML algorithms to enhance the prediction accuracy of students' online learning performance.
Results show that the framework yields nearly perfect prediction performance for autonomous students and satisfactory performance for motivated students.
arXiv Detail & Related papers (2024-03-28T03:29:02Z) - 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) - Manipulating Predictions over Discrete Inputs in Machine Teaching [43.914943603238996]
This paper focuses on machine teaching in the discrete domain, specifically on manipulating student models' predictions based on the goals of teachers via changing the training data efficiently.
We formulate this task as a optimization problem and solve it by proposing an iterative searching algorithm.
Our algorithm demonstrates significant numerical merit in the scenarios where a teacher attempts at correcting erroneous predictions to improve the student's models, or maliciously manipulating the model to misclassify some specific samples to the target class aligned with his personal profits.
arXiv Detail & Related papers (2024-01-31T14:23:51Z) - A Self-supervised Contrastive Learning Method for Grasp Outcomes
Prediction [9.865029065814236]
We show that contrastive learning methods perform well on the task of grasp outcomes prediction.
Our results reveal the potential of contrastive learning methods for applications in the field of robot grasping.
arXiv Detail & Related papers (2023-06-26T06:06:49Z) - A Predictive Model using Machine Learning Algorithm in Identifying
Students Probability on Passing Semestral Course [0.0]
This study employs classification for data mining techniques, and decision tree for algorithm.
With the utilization of the newly discovered predictive model, the prediction of students probabilities to pass the current courses they take gives 0.7619 accuracy, 0.8333 precision, 0.8823 recall, and 0.8571 f1 score.
arXiv Detail & Related papers (2023-04-12T01:57:08Z) - 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) - Weighted Ensemble Self-Supervised Learning [67.24482854208783]
Ensembling has proven to be a powerful technique for boosting model performance.
We develop a framework that permits data-dependent weighted cross-entropy losses.
Our method outperforms both in multiple evaluation metrics on ImageNet-1K.
arXiv Detail & Related papers (2022-11-18T02:00:17Z) - Learning Predictions for Algorithms with Predictions [49.341241064279714]
We introduce a general design approach for algorithms that learn predictors.
We apply techniques from online learning to learn against adversarial instances, tune robustness-consistency trade-offs, and obtain new statistical guarantees.
We demonstrate the effectiveness of our approach at deriving learning algorithms by analyzing methods for bipartite matching, page migration, ski-rental, and job scheduling.
arXiv Detail & Related papers (2022-02-18T17:25:43Z) - Bayesian Graph Contrastive Learning [55.36652660268726]
We propose a novel perspective of graph contrastive learning methods showing random augmentations leads to encoders.
Our proposed method represents each node by a distribution in the latent space in contrast to existing techniques which embed each node to a deterministic vector.
We show a considerable improvement in performance compared to existing state-of-the-art methods on several benchmark datasets.
arXiv Detail & Related papers (2021-12-15T01:45:32Z) - Double Robust Representation Learning for Counterfactual Prediction [68.78210173955001]
We propose a novel scalable method to learn double-robust representations for counterfactual predictions.
We make robust and efficient counterfactual predictions for both individual and average treatment effects.
The algorithm shows competitive performance with the state-of-the-art on real world and synthetic data.
arXiv Detail & Related papers (2020-10-15T16:39:26Z)
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.