Personalized Learning Path Problem Variations: Computational Complexity and AI Approaches
Open Access
- 18 October 2024
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Artificial Intelligence
- Vol. 6 (3) , 574-588
Abstract
E-learning courses often suffer from high dropout rates and low student satisfaction. One way to address this issue is to use Personalized Learning Paths (PLPs), which are sequences of learning materials that meet the individual needs of students. However, creating PLPs is difficult and often involves combining knowledge graphs, student profiles, and learning materials. Researchers typically assume that the problem of creating PLPs belong to the NP-Hard class of computational problems. However, previous research in this field has neither defined the different variations of the PLP problem nor formally established their computational complexity. Without clear definitions of the PLP variations, researchers risk making invalid comparisons and conclusions when they use different metaheuristics for different PLP problems. In order to unify this conversation, this paper formally proves the NP-completeness of two common PLP variations and their generalizations and uses them to categorize recent research in the PLP field. It then presents an instance of the PLP problem using real-world data and shows how this instance can be cast into two different NP-complete variations. This paper then presents three AI strategies, solving one of the PLP variations with back-tracking and branch and bound heuristics and also converting the PLP variation instance to XCSP 3 , an intermediate constraint satisfaction language to be resolved with a general Constraint Optimization solver. This paper solves the other PLP variation instance using a greedy search heuristic. The paper finishes by comparing the results of the two different PLP variations.Keywords
Funding Information
- U.S. Department of Veterans Affairs (2022-133)
This publication has 27 references indexed in Scilit:
- Fully Individualized Curriculum with Decaying Knowledge, a New Hard Problem: Investigation and RecommendationsInternational Journal of Artificial Intelligence in Education, 2023
- An improved adaptive learning path recommendation model driven by real-time learning analyticsJournal of Computers in Education, 2022
- A systematic review of learning path recommender systemsEducation and Information Technologies, 2022
- Research on personalized learning path planning model based on knowledge networkNeural Computing and Applications, 2022
- A systematic literature review on adaptive content recommenders in personalized learning environments from 2015 to 2020Journal of Computers in Education, 2021
- A comparative analysis of metaheuristics applied to adaptive curriculum sequencingSoft Computing, 2021
- The COVID-19 pandemic and E-learning: challenges and opportunities from the perspective of students and instructorsJournal of Computing in Higher Education, 2021
- Metaheuristic-based adaptive curriculum sequencing approaches: a systematic review and mapping of the literatureArtificial Intelligence Review, 2020
- Reasoning from last conflict(s) in constraint programmingArtificial Intelligence, 2009
- Comparing dropouts and persistence in e-learning coursesComputers & Education, 2007