The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Temporal Models for Predicting Student Dropout in Massive Open Online Courses
Abstract
Over the past few years, the rapid emergence of massive open online courses (MOOCs) has sparked a great deal of research interest in MOOC data analytics. Dropout prediction, or identifying students at risk of dropping out of a course, is an important problem to study due to the high attrition rate commonly found on many MOOC platforms. The methods proposed recently for dropout prediction apply relatively simple machine learning methods like support vector machines and logistic regression, using features that reflect such student activities as lecture video watching and forum activities on a MOOC platform during the study period of a course. Since the features are captured continuously for each student over a period of time, dropout prediction is essentially a time series prediction problem. By regarding dropout prediction as a sequence classification problem, we propose some temporal models for solving it. In particular, based on extensive experiments conducted on two MOOCs offered on Coursera and edX, a recurrent neural network (RNN) model with long short-term memory (LSTM) cells beats the baseline methods as well as our other proposed methods by a large margin.
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
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
(2016) · Cited by 11,679
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
Breitung, J., & Hamilton, J. D. (1995) · Contemporary Sociology · doi:10.2307/2076916 · Cited by 10,966
Speech recognition with deep recurrent neural networks
Graves, A., Mohamed, A.-R., & Hinton, G. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638947 · Cited by 8,893 · cited 1×
“This figure is from [23].”
Learning long-term dependencies with gradient descent is difficult
Bengio, Y., Simard, P., & Frasconi, P. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279181 · Cited by 8,542
Hamilton, J. D. (1994) · Princeton University Press eBooks · doi:10.1515/9780691218632 · Cited by 7,293
Graves, A., Fernández, S., Gomez, F., & Schmidhuber, J. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143891 · Cited by 5,370
Booth, D. E. (1997) · Technometrics · doi:10.1080/00401706.1997.10485448 · Cited by 3,201
Supervised Sequence Labelling with Recurrent Neural Networks
Graves, A. (2012) · Studies in Computational Intelligence · doi:10.1007/978-3-642-24797-2 · Cited by 3,120
Attractor dynamics and parallelism in a connectionist sequential machine
Jordan, M. I. (1986) · eScholarship (California Digital Library) · Cited by 709
Framewise phoneme classification with bidirectional LSTM networks
Graves, A., & Schmidhuber, J. (2006) · Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005. · doi:10.1109/ijcnn.2005.1556215 · Cited by 618
Grossberg, S. (2013) · Scholarpedia · doi:10.4249/scholarpedia.1888 · Cited by 602
From time series to linear system—Part I. Finite dimensional linear time invariant systems
Willems, J. C. (1986) · Automatica · doi:10.1016/0005-1098(86)90066-x · Cited by 569
Parameter estimation for linear dynamical systems
Ghahramani, Z., & Hinton, G. E. (1996) · Cambridge University Engineering Department Publications Database · Cited by 484
An Input Output HMM Architecture
Bengio, Y., & Frasconi, P. (1994) · Florence Research (University of Florence) · Cited by 332
“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
Unconstrained On-line Handwriting Recognition with Recurrent Neural Networks
Graves, A., Liwicki, M., Horst Bunke, A., Schmidhuber, J., & Fernández, S. (2007) · Bern Open Repository and Information System (University of Bern) · Cited by 222
Identifying At-Risk Students in Massive Open Online Courses
He, J., Bailey, J., Rubinstein, B., & Zhang, R. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9471 · Cited by 211
Comparisons of sequence labeling algorithms and extensions
Nguyen, N., & Guo, Y. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273582 · Cited by 183
Liwicki, M., Graves, A., Horst Bunke, A., & Schmidhuber, J. (2007) · BORIS (University Library Bern) · Cited by 183
Introducing CURRENNT: the Munich open-source CUDA recurrent neural network toolkit
Weninger, F. J., Bergmann, J. M., & Schuller, B. W. (2015) · Spiral (Imperial College London) · Cited by 154
Likely to stop? Predicting Stopout in Massive Open Online CoursesPreprint
Taylor, C., Veeramachaneni, K. K., & O’Reilly, U.-M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.3382 · Cited by 142
On the approximation capability of recurrent neural networks
Hammer, B. (2000) · Neurocomputing · doi:10.1016/s0925-2312(99)00174-5 · Cited by 132
Fast model-based protein homology detection without alignment
Hochreiter, S., Heusel, M., & Obermayer, K. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm247 · Cited by 132
“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
Sinha, T., Li, N., Jermann, P., & Dillenbourg, P. (2014) · doi:10.3115/v1/w14-4108 · Cited by 74
Predicting Attrition Along the Way: The UIUC Model
Amnueypornsakul, B., Bhat, S., & Chinprutthiwong, P. (2014) · doi:10.3115/v1/w14-4110 · Cited by 56
A Process for Predicting MOOC Attrition
Sharkey, M., & Sanders, R. (2014) · doi:10.3115/v1/w14-4109 · Cited by 36
Ahlawat, S. (2022) · Apress eBooks · doi:10.1007/978-1-4842-8835-1_4 · Cited by 8
Cited by
Predicting academic performance of students from VLE big data using deep learning models
Waheed, H., Hassan, S.-U., Aljohani, N. R., Hardman, J., Alelyani, S., & Nawaz, R. (2020) · Computers in Human Behavior · doi:10.1016/j.chb.2019.106189 · Cited by 573
Bandara, K., Bergmeir, C., & Smyl, S. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112896 · Cited by 435
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
Prediction of students’ early dropout based on their interaction logs in online learning environment
Mubarak, A. A., Cao, H., & Zhang, W. (2022) · Interactive Learning Environments · doi:10.1080/10494820.2020.1727529 · Cited by 170
Metadata
- Authors
- Fei, M., & Yeung, D.-Y.
- Venue
- 2015 IEEE International Conference on Data Mining Workshop (ICDMW)
- Publisher
- IEEE
- Published
- 2015-11
- Pages
- 256-263
- OpenAlex
- W2546314413
- Cited by
- 276
- References
- 33
- FWCI
- 10.29
- Type
- conference paper
- Language
- en
- Open access
- closed
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.