A Multigranularity Learning Path Recommendation Framework Based on Knowledge Graph and Improved Ant Colony Optimization Algorithm for E-Learning

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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Computational Social Systems
Published
2024-11-11
DOI
https://doi.org/10.1109/tcss.2024.3488373
Citations
4
Primary Topic
Educational Technology and Assessment
Type
article
Field-Weighted Citation Impact
3.12
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Multigranularity Learning Path Recommendation Framework Based on Knowledge Graph and Improved Ant Colony Optimization Algorithm for E-Learning

Yaping Xu, Yaqian Zheng, Yanyan Li, Deliang Wang
4 citations
IEEE Transactions on Computational Social Systems
Educational Technology and Assessment
3.12
article

A Multigranularity Learning Path Recommendation Framework Based on Knowledge Graph and Improved Ant Colony Optimization Algorithm for E-Learning

Yaping Xu, Yaqian Zheng, Yanyan Li, Deliang Wang
article en
4 citations

Abstract

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.

IEEE Transactions on Computational Social SystemsVol. 12(2)
Beijing Normal University (CN), University of Hong Kong (HK)
Openalex Percentile: Top 7%
Educational Technology and Assessment
3.12
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.