Sciweavers

Share
ICALT
2006
IEEE

A Shortest Learning Path Selection Algorithm in E-learning

9 years 6 months ago
A Shortest Learning Path Selection Algorithm in E-learning
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 shortest learning paths to learn the target knowledge.
Chengling Zhao, Liyong Wan
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where ICALT
Authors Chengling Zhao, Liyong Wan
Comments (0)
books