Ranking Difficulty of Knowledge Units Based on Learning Dependency
Ranking Difficulty of Knowledge Units Based on Learning Dependency
复制标题
基于学习依赖的知识单元难度排序
DOI：
10.1109/icebe.2010.17
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Ling Chen
中科院分区：
文献类型：
--
作者：
Jun Liu;Sha Sha;Q. Zheng;Ling Chen
利用知识地图计算知识单元的难易程度并进行排序，可以更有效地指导学习者规划学习活动。本文主要研究如何利用知识地图的拓扑结构来计算知识单元的难度并进行排序。给出了知识地图的层次结构和性质，基于知识单元难度与学习依赖的相关性提出了三个假设，并给出了一种基于客观和主观难度的知识单元排序方法。在“平面几何”知识地图上的实验表明，该方法能够准确地计算出知识单元的难度。
Using knowledge maps to compute and rank the difficulty level of knowledge units can guide learners plan their learning activities more effectively. This paper focuses on how to use the topology of a knowledge map to compute and rank the difficulty of knowledge units. We present the hierarchical structure and properties of knowledge maps, propose three hypotheses based on the correlation between the difficulty of knowledge units and learning dependency, and then provide a method for ranking knowledge units with objective and subjective difficulty. The experiment on the “plane geometry” knowledge map shows that our methods can precisely calculate the difficulty of knowledge units.
DOI：
--
发表时间：
2008
期刊：
Proc. of the 23rd Annual ACM Symposium on Applied Computing 2008 1
影响因子：
--
作者：
Akira Osada;Daigo Ozawa;Naoyuki Kitazawa;Haruhiko Kaiya;and Kenji Kaijiri
通讯作者：
and Kenji Kaijiri