The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Identifying At-Risk Students in Massive Open Online Courses
Open accessAbstract
Massive Open Online Courses (MOOCs) have received widespread attention for their potential to scale higher education, with multiple platforms such as Coursera, edX and Udacity recently appearing. Despite their successes, a major problem faced by MOOCs is low completion rates. In this paper, we explore the accurate early identification of students who are at risk of not completing courses. We build predictive models weekly, over multiple offerings of a course. Furthermore, we envision student interventions that present meaningful probabilities of failure, enacted only for marginal students.To be effective, predicted probabilities must be both well-calibrated and smoothed across weeks.Based on logistic regression, we propose two transfer learning algorithms to trade-off smoothness and accuracy by adding a regularization term to minimize the difference of failure probabilities between consecutive weeks. Experimental results on two offerings of a Coursera MOOC establish the effectiveness of our algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Predicting good probabilities with supervised learning
Niculescu-Mizil, A., & Caruana, R. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102430 · Cited by 1,884
“Predicting MOOC dropout over weeks using machine learning methods,”
Kloft, M., Stiehler, F., Zheng, Z., & Pinkwart, N. (2014) · Proceedings of the EMNLP 2014 Workshop on Analysis of Large Scale Social Interaction in MOOCs · doi:10.3115/v1/w14-4111 · Cited by 325
“Learning latent engagement patterns of students in online courses,”
Ramesh, A., Goldwasser, D., Huang, B., Daume III, H., & Getoor, L. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8920 · Cited by 123 · cited 1×
“The same methodology is then used to predict a similar task for whether students submitted their final quizzes/assignments (Ramesh et al. 2014).”
Method
Cited by
Utilising learning analytics to support study success in higher education: a systematic review
Ifenthaler, D., & Yau, J. Y.-K. (2020) · Educational Technology Research and Development · doi:10.1007/s11423-020-09788-z · Cited by 659
A Systematic Literature Review of Student’ Performance Prediction Using Machine Learning Techniques
Albreiki, B., Zaki, N., & Alashwal, H. (2021) · Education Sciences · doi:10.3390/educsci11090552 · Cited by 427
Dropout Prediction in MOOCs: Using Deep Learning for Personalized Intervention
Xing, W., & Du, D. (2019) · Journal of Educational Computing Research · doi:10.1177/0735633118757015 · Cited by 321
Temporal Models for Predicting Student Dropout in Massive Open Online Courses
Fei, M., & Yeung, D.-Y. (2015) · 2015 IEEE International Conference on Data Mining Workshop (ICDMW) · doi:10.1109/icdmw.2015.174 · Cited by 276
Interpretable dropout prediction: towards XAI-based personalized intervention
Nagy, M., & Molontay, R. (2024) · International Journal of Artificial Intelligence in Education · doi:10.1007/s40593-023-00331-8 · Cited by 179
“Additionally, AI can customize learning paths (Yu et al., 2017), or notify the instructors about which students are likely to drop out of a massive open online course (MOOC) (He et al., 2015).”
Metadata
- Authors
- He, J., Bailey, J., Rubinstein, B., & Zhang, R.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2015-02-18
- Volume
- 29
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2395088234
- Cited by
- 211
- References
- 3
- FWCI
- 15.32
- Type
- conference paper
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.