Adaptive learning path recommender approach using auxiliary learning objects
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
In e-learning, one of the main difficulties is recommending learning materials that users can complete on time. It becomes more challenging when users cannot devote enough time to learn the entire course. In this paper, we describe two approaches to maximize users’ scores for a course while satisfying their time constraints. These approaches recommend successful paths based on the available time and knowledge background of users. We first briefly explain a method that has a similar goal to our method, and highlight its drawbacks. We then describe our proposal, which works based on a two-layered course graph (lesson and Learning Object (LO) layers; a lesson includes a few LO). Initially, our method uses the Depth First Search algorithm (DFS) to find all lesson sequences in the graph that start by a lesson (opted by a user). It then assigns LO for lessons of paths and estimates their score and time. Finally, a path that satisfies the user’s limited time while maximizing his/her score is recommended lesson by lesson. During a path recommendation, if the user could not get the estimated score from a lesson, our method recommends auxiliary LO for that lesson. To evaluate our method, we first assessed the quality of our estimation methods and then evaluate our recommender in a live environment. Results show that our estimation methods outperformed the ones in the literature. Results also present within the same amount of time, the users of our recommender proceeded more on the course than the users of another e-learning system.
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
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
The ASA Statement on p -Values: Context, Process, and Purpose
Wasserstein, R. L., & Lazar, N. A. (2016) · The American Statistician · doi:10.1080/00031305.2016.1154108 · Cited by 6,306 · cited 1×
“To evaluate how significant was the difference between the course coverage of two groups (first hypothesis), we estimated the 𝑝 -value (Wasserstein, Lazar, et al., 2016) using the groups’ time.”
E-Learning personalization based on hybrid recommendation strategy and learning style identification
Klašnja-Milićević, A., Vesin, B., Ivanović, M., & Budimac, Z. (2011) · Computers & Education · doi:10.1016/j.compedu.2010.11.001 · Cited by 580
Cited by
A systematic literature review of personalized learning terms
Shemshack, A., & Spector, J. M. (2020) · Smart Learning Environments · doi:10.1186/s40561-020-00140-9 · Cited by 740
Raj, N. S., & Renumol, V. G. (2022) · Journal of Computers in Education · doi:10.1007/s40692-021-00199-4 · Cited by 253
Artificial intelligence-enabled adaptive learning platforms: A review
Tan, L. Y., Hu, S., Yeo, D. J., & Cheong, K. H. (2025) · Computers and Education: Artificial Intelligence · doi:10.1016/j.caeai.2025.100429 · Cited by 207
Metadata
- Authors
- Nabizadeh, A. H., Gonçalves, D., Gama, S., Jorge, J., & Rafsanjani, H. N.
- Venue
- Computers & Education
- Publisher
- Elsevier BV
- Published
- 2020-04
- Volume
- 147
- Pages
- 103777
- ISSN
- 0360-1315 (ISSN-L)
- OpenAlex
- W2991846997
- Cited by
- 119
- References
- 3
- FWCI
- 14.06
- Type
- journal article
- 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.