.png){kind=icon}
返回
On Learning Path Planning Algorithm Based on Collaborative Analysis of Learning Behavior
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3005793.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Studying learning path planning can help find useful implicit learning behavior patterns from learners' online learning behavior data, which is conducive to helping beginners or learners with low participation to reasonably arrange the learning sequence of online knowledge points. This paper proposes a learning path planning algorithm based on collaborative analysis of learning behavior through collaborative data analysis of online learning behaviors. The algorithm, based on the learner's online learning behavior data set, first establishes the concept interaction degree model of knowledge points and the directed learning path network, and proposes a local structure similarity measurement method between the knowledge nodes of the directed learning path network. Second, based on the learner's Kullback-Leibler divergence (KLD) matrix, a learning behavior similarity calculation method on the basis of eigenvector matrix similarity is proposed, which is used to perform cluster analysis on learners with similar learning behaviors and to analyze the personalized optimal learning path of each kind of learners. Finally, the clustering algorithm and the evaluation index of the directed complex network have both verified the advantages of the algorithm. This paper employs the online behavior data set and online test data set obtained from the e-learning platform to conduct an empirical analysis of the learning path planning algorithm proposed hereof. The results show that the learner's learning effect has been improved, verifying the validity and reliability of the algorithm.
Keyword:
Local structural similarity on the knowledge node of the directed learning path network
similarity measure on learning behavior
concept interaction degree of knowledge points
individualized optimal learning path
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
A learning path recommendation model based on a multidimensional knowledge graph framework for e-learning基于多维知识图谱框架的e-learning学习路径推荐模型
PREAI
分享收藏
分享收藏
查看更多内容