跳到主要导航 跳到搜索 跳到主要内容

Ranking difficulty of knowledge units based on learning dependency

  • Xi'an Jiaotong University

科研成果: 书/报告/会议事项章节会议稿件同行评审

3 引用 (Scopus)

摘要

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.

源语言英语
主期刊名Proceedings - IEEE International Conference on E-Business Engineering, ICEBE 2010
77-82
页数6
DOI
出版状态已出版 - 2010
活动IEEE International Conference on E-Business Engineering, ICEBE 2010 - Shanghai, 中国
期限: 10 11月 201012 11月 2010

丛书

姓名Proceedings - IEEE International Conference on E-Business Engineering, ICEBE 2010

会议

会议IEEE International Conference on E-Business Engineering, ICEBE 2010
国家/地区中国
Shanghai
时期10/11/1012/11/10

学术指纹

探究 'Ranking difficulty of knowledge units based on learning dependency' 的科研主题。它们共同构成独一无二的学术指纹。

引用此