A Shortest Learning Path Selection Algorithm in E-learning

Author

Zhao, Chengling ; Wan, Liyong

Author_Institution

Dept. of Inf. Technol., Central China Normal Univ., Wuhan

fYear

2006

fDate

5-7 July 2006

Firstpage

94

Lastpage

95

Abstract

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

Keywords

computer aided instruction; educational administrative data processing; graph theory; semantic networks; course modeling; e-learning systems; graph structure; graph theory; knowledge node representation; semantic network; shortest learning path selection; Costs; Electronic learning; Information technology; Intelligent networks; Internet; Joining processes; Statistical analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Learning Technologies, 2006. Sixth International Conference on

Conference_Location

Kerkrade

Print_ISBN

0-7695-2632-2

Type

conf

DOI

10.1109/ICALT.2006.1652375

Filename

1652375