A Multigranularity Learning Path Recommendation Framework Based on Knowledge Graph and Improved Ant Colony Optimization Algorithm for E-Learning
Bibliographic Data
| ID | 22108943 |
|---|---|
| Authors | Yaqian Zheng (0009-0005-9807-3623, Beijing Normal University), Deliang Wang (0009-0008-6488-0234, University of Hong Kong), Yaping Xu (0009-0003-2326-384X, Beijing Normal University), Yanyan Li (0009-0000-0010-2654, Beijing Normal University) |
| Year | 2025 |
| Volume | 12 |
| Issue | 2 |
| Pages | 586-607 |
| Publication date | 2025-04-01 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | IEEE Transactions on Computational Social Systems (JOURNAL) |
| Journal identifiers | ISSN: 2329-924X • E-ISSN: 2373-7476 |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) (PUBLISHER) |
| DOI | 10.1109/tcss.2024.3488373 |
| OpenAlex | W4404238568 |
| Language | EN |
| References cited | 82 |
In e-learning, extracting suitable learning objects (LOs) from a vast resource pool and organizing them into high-quality learning paths is crucial for helping e-learners achieve their goals. Numerous approaches have been proposed to recommend optimal learning paths for e-learners. However, it is essential to emphasize that e-learning systems typically consist of a wide range of LOs with varying levels of granularity, ranging from fine-grained to coarse-grained. Unfortunately, current research has not adequately considered the underlying granularity structure of LOs when optimizing learning paths. Existing methods primarily focus on organizing LOs at a single granularity level, limiting their applicability in real-world e-learning systems. To address the limitations, we propose a multigranularity learning path recommendation (MGLPR) framework that aims to flexibly and effectively integrate the diverse granularity levels of LOs into high-quality learning paths. In this framework, a two-layer [knowledge point (KP) and LO layers] model is developed to formulate the MGLPR problem as a constrained optimization problem and an improved ant colony optimization algorithm (IACO) is introduced to solve it to identify optimal learning paths for e-learners. To evaluate the effectiveness of the proposed IACO, we conducted extensive computational experiments using 30 simulation datasets with varying problem sizes and complexities. The results demonstrate that our proposed IACO achieves superior performance and robustness compared with other competitors. Additionally, an empirical study was conducted to investigate the efficacy of the proposed approach in an authentic learning context, with results indicating that the proposed method outperforms the traditional self-organized ones
Algorithm · ANT · Ant colony · Ant colony optimization algorithms · Computer network · Graph · Machine learning · Computer Science · Educational Technology and Assessment · Power Systems and Technologies · Recommender Systems and Techniques · Artificial Intelligence · Theoretical Computer Science
Adapting New Learners and New Resources to Micro Open Learning via Online Computation
A Clinical-Oriented Non-Severe Depression Diagnosis Method Based on Cognitive Behavior of Emotional Conflict
Research on a personalized learning path recommendation system based on cognitive graph with a cognitive graph
An improved constrained learning path adaptation problem based on genetic algorithm
Evaluating E-learning systems success
MoodleREC
Does an individualized learning design improve university student online learning? A randomized field experiment
Adaptive learning path recommender approach using auxiliary learning objects
| Citation velocity | historical |
|---|---|
| Highly cited | No |