版权说明 操作指南
首页 > 成果 > 详情

A shortest learning path selection algorithm in e-learning

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文、会议论文
作者:
Chengling, Zhao;Liyong, Wan
通讯作者:
Chengling, Z.
作者机构:
[Liyong, Wan; Chengling, Zhao] Department of Information Technology, Central China Normal University, Wu-Han, China
语种:
英文
期刊:
Proceedings - Sixth International Conference on Advanced Learning Technologies, ICALT 2006
ISSN:
2161-3761
年:
2006
卷:
2006
页码:
94-95
会议名称:
6th International Conference on Advanced Learning Technologies, ICALT 2006
会议时间:
July 5, 2006 - July 7, 2006
会议地点:
Kerkrade, Netherlands
会议主办单位:
(1) Department of Information Technology, Central China Normal University, Wu-Han, China
会议赞助商:
IEEE Technical Committee on Learning Technology;IEEE Computer Society;Fontys University of Applied Sciences, The Netherlands
出版者:
Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331, Piscataway, NJ 08855-1331, United States
机构署名:
本校为第一机构
院系归属:
教育信息技术学院
摘要:
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic network. The desired knowledge is provided by the student as a direct request or from search results, mapping the owned knowledge onto the target knowledge. How to select a learning path which costs the least time and effort is critical. In this paper, we described the relationships between different nodes in the graph structure of knowledge units and propose an algorithm to select the s...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com