Predicting University Students’ Academic Success and Major Using Random Forests
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
In this article, a large data set containing every course taken by every undergraduate student in a major university in Canada over 10 years is analysed. Modern machine learning algorithms can use large data sets to build useful tools for the data provider, in this case, the university. In this article, two classifiers are constructed using random forests. To begin, the first two semesters of courses completed by a student are used to predict if they will obtain an undergraduate degree. Secondly, for the students that completed a program, their major is predicted using once again the first few courses they have registered to. A classification tree is an intuitive and powerful classifier and building a random forest of trees improves this classifier. Random forests also allow for reliable variable importance measurements. These measures explain what variables are useful to the classifiers and can be used to better understand what is statistically related to the students’ situation. The results are two accurate classifiers and a variable importance analysis that provides useful information to university administrations.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Unbiased Recursive Partitioning: A Conditional Inference Framework
Hothorn, T., Hornik, K., & Zeileis, A. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x133933 · Cited by 4,021
Cited by
Fahd, K., Venkatraman, S., Miah, S. J., & Ahmed, K. (2022) · Education and Information Technologies · doi:10.1007/s10639-021-10741-7 · Cited by 110
A Review of Artificial Intelligence in K-12 Education
Azzam, A., & Charles, T. (2024) · Open Journal of Applied Sciences · doi:10.4236/ojapps.2024.148137 · Cited by 37
Should learning analytics models include sensitive attributes? Explaining the why
Deho, O. B., Joksimovic, S., Li, J., Zhan, C., Liu, J., & Liu, L. (2023) · IEEE Transactions on Learning Technologies · doi:10.1109/tlt.2022.3226474 · Cited by 35
“A similar work to ours which is not primarily concerned with fairness but touches a bit on explainability is done in [35].”
BackgroundPérez-Jorge, D., González-Afonso, M. C., Santos-Álvarez, A. G., Plasencia-Carballo, Z., & Perdomo-López, C. D. L. Á. (2025) · Information · doi:10.3390/info16070540 · Cited by 9
Metadata
- Authors
- Beaulac, C., & Rosenthal, J. S.
- Venue
- Research in Higher Education
- Published
- 2019-01-25
- Volume
- 60
- Issue
- 7
- Pages
- 1048-1064
- ISSN
- 0361-0365 (ISSN-L)
- 1573-188X
- OpenAlex
- W2893802547
- Cited by
- 163
- References
- 3
- FWCI
- 15.25
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Predicting University Students’ Academic Success and Major Using Random Forests. https://app.cochat.ai/papers/10.1007/s11162-019-09546-y
- The paper
- Beaulac, C., & Rosenthal, J. S. (2019). Predicting University Students’ Academic Success and Major Using Random Forests. Research in Higher Education. https://doi.org/10.1007/s11162-019-09546-y
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.