Evidence map›Paper›PMID 38855215›Full record

ArticlePeerJ. Computer science2024

Achieving optimal trade-off for student dropout prediction with multi-objective reinforcement learning.

Feng Pan, Hanfei Zhang, Xuebao Li, Moyu Zhang, Yang Ji

Abstract read
In one paragraph

Article in PeerJ. Computer science, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Feng PanSchool of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China.
Hanfei ZhangSchool of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China.
Xuebao LiSchool of Information Science and Technology, Baotou Teachers' College, Baotou, Inner Mongolia, China.
Moyu ZhangSchool of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China.
Yang JiSchool of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Student dropout prediction (SDP) in educational research has gained prominence for its role in analyzing student learning behaviors through time series models. Traditional methods often focus singularly on either prediction accuracy or earliness, leading to sub-optimal interventions for at-risk students. This issue underlines the necessity for methods that effectively manage the trade-off between accuracy and earliness. Recognizing the limitations of existing methods, this study introduces a novel approach leveraging multi-objective reinforcement learning (MORL) to optimize the trade-off between prediction accuracy and earliness in SDP tasks. By framing SDP as a partial sequence classification problem, we model it through a multiple-objective Markov decision process (MOMDP), incorporating a vectorized reward function that maintains the distinctiveness of each objective, thereby preventing information loss and enabling more nuanced optimization strategies. Furthermore, we introduce an advanced envelope Q-learning technique to foster a comprehensive exploration of the solution space, aiming to identify Pareto-optimal strategies that accommodate a broader spectrum of preferences. The efficacy of our model has been rigorously validated through comprehensive evaluations on real-world MOOC datasets. These evaluations have demonstrated our model's superiority, outperforming existing methods in achieving optimal trade-off between accuracy and earliness, thus marking a significant advancement in the field of SDP.

Indexed as

Envelope Q-learningMulti-objective reinforcement learningStudent dropout predictionTrade-offVector reward

Identifiers

PMID38855215
PMCPMC11157558

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.