TY - GEN
T1 - Learning Optimal and Personalized Knowledge Component Sequencing Policies
AU - Lin, Fuhua
AU - Howard, Leo
AU - Yan, Hongxin
N1 - Publisher Copyright:
© 2022, Springer Nature Switzerland AG.
PY - 2022
Y1 - 2022
N2 - One of the goals of adaptive learning systems is to realize adaptive learning sequencing by optimizing the order of learning materials to be presented to different learners. This paper proposes a novel approach to recommending optimal and personalized learning sequences for learners taking an online course based on the contextual bandit framework where the background knowledge of the learners is the context. To improve learning efficiency and performance of learners, the adaption engine of such an adaptive learning system can select an optimal learning path for a learner by continually evaluating the learners’ progress as the course advances. To overcome the complexity of learning path recommendation due to the large number of knowledge components, we use the ‘divide-and-conquer’ approach to modeling the domain and designing the sequence adaptation algorithm. Also, the adaptation engine can dynamically replan the learning path for a learner if her/his performance is worse than expected. Finally, our approach can improve over time by learning from the experience of previous learners who adopted recommended sequences.
AB - One of the goals of adaptive learning systems is to realize adaptive learning sequencing by optimizing the order of learning materials to be presented to different learners. This paper proposes a novel approach to recommending optimal and personalized learning sequences for learners taking an online course based on the contextual bandit framework where the background knowledge of the learners is the context. To improve learning efficiency and performance of learners, the adaption engine of such an adaptive learning system can select an optimal learning path for a learner by continually evaluating the learners’ progress as the course advances. To overcome the complexity of learning path recommendation due to the large number of knowledge components, we use the ‘divide-and-conquer’ approach to modeling the domain and designing the sequence adaptation algorithm. Also, the adaptation engine can dynamically replan the learning path for a learner if her/his performance is worse than expected. Finally, our approach can improve over time by learning from the experience of previous learners who adopted recommended sequences.
KW - Adaptive learning
KW - Bandit algorithms
KW - Learning path recommendation
KW - Sequence adaptivity
UR - http://www.scopus.com/inward/record.url?scp=85135905873&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-11647-6_65
DO - 10.1007/978-3-031-11647-6_65
M3 - Published Conference contribution
AN - SCOPUS:85135905873
SN - 9783031116469
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 338
EP - 342
BT - Artificial Intelligence in Education. Posters and Late Breaking Results, Workshops and Tutorials, Industry and Innovation Tracks, Practitioners’ and Doctoral Consortium - 23rd International Conference, AIED 2022, Proceedings
A2 - Rodrigo, Maria Mercedes
A2 - Matsuda, Noburu
A2 - Cristea, Alexandra I.
A2 - Dimitrova, Vania
T2 - 23rd International Conference on Artificial Intelligence in Education, AIED 2022
Y2 - 27 July 2022 through 31 July 2022
ER -