Next-term student grade prediction
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
An enduring issue in higher education is student retention to successful graduation. To further this goal, we develop a system for the task of predicting students' course grades for the next enrollment term in a traditional university setting. Each term, students enroll in a limited number of courses and earn grades in the range A-F for each course. Given historical grade data, our task is to predict the grades for each student in the courses they will enroll in during the next term. With this problem formulation, the next-term student grade prediction problem becomes quite similar to a rating prediction or next-basket recommendation problem. The factorization machine (FM), a general-purpose matrix factorization (MF) algorithm suitable for this task, is leveraged as the state-of-the-art method and compared to a variety of other methods. Our experiments show that FMs achieve the lowest prediction error. Results for both cold-start and non-cold-start prediction demonstrate that FMs can be used to accurately predict in both settings. Finally, we identify limitations observed in FMs and the other models tested and discuss directions for future work. To our knowledge, this is the first study that applies state-of-the-art collaborative filtering algorithms to solve the next-term student grade prediction problem.
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
Amazon.com recommendations: item-to-item collaborative filtering
Linden, G., Smith, B., & York, J. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1167344 · Cited by 5,403
Restricted Boltzmann machines for collaborative filtering
Salakhutdinov, R., Mnih, A., & Hinton, G. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273596 · Cited by 1,885
Cited by
Aldowah, H., Al-Samarraie, H., & Fauzy, W. M. (2019) · Telematics and Informatics · doi:10.1016/j.tele.2019.01.007 · Cited by 564
Analyzing and Predicting Students’ Performance by Means of Machine Learning: A Review
Rastrollo-Guerrero, J. L., Gómez-Pulido, J. A., & Durán-Domínguez, A. (2020) · Applied Sciences · doi:10.3390/app10031042 · Cited by 367
Good proctor or “big brother”? Ethics of online exam supervision technologies
Coghlan, S., Miller, T., & Paterson, J. (2021) · Philosophy & Technology · doi:10.1007/s13347-021-00476-1 · Cited by 219
Redefining profit metrics for boosting student retention in higher education
Maldonado, S., Miranda, J., Olaya, D., Vásquez, J., & Verbeke, W. (2021) · Decision Support Systems · doi:10.1016/j.dss.2021.113493 · Cited by 36
Learning Analytics Lens: Improving Quality of Higher Education
Hooda, M. (2020) · International Journal of Emerging Trends in Engineering Research · doi:10.30534/ijeter/2020/24852020 · Cited by 30
De Oliveira, T. N., Bernardini, F., & Viterbo, J. (2021) · 2021 IEEE Frontiers in Education Conference (FIE) · doi:10.1109/fie49875.2021.9637207 · Cited by 8
Metadata
- Authors
- Sweeney, M., Lester, J., & Rangwala, H.
- Venue
- 2015 IEEE International Conference on Big Data (Big Data)
- Publisher
- IEEE
- Published
- 2015-10
- Pages
- 970-975
- OpenAlex
- W2206224721
- Cited by
- 104
- References
- 2
- FWCI
- 5.03
- 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.