A Shortest Learning Path Selection Algorithm in E-learning

Authors:
Chengling Zhao;Liyong Wan
Affiliations:
Central China Normal University, China;Central China Normal University, China
Venue:
ICALT '06 Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies
Year:
2006

Citing 0
Cited 5

Applying Weighted Learning Object to Build Adaptive Course in E-learning

Proceedings of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding
An adaptive navigation support system for conducting context-aware ubiquitous learning in museums

Computers & Education
Groupized learning path discovery based on member profile

ICWL'10 Proceedings of the 2010 international conference on New horizons in web-based learning
Generating a two-phase lesson for guiding beginners to learn basic dance movements

Computers & Education
A Heuristic Method for Learning Path Sequencing for Intelligent Tutoring System ITS in E-learning

International Journal of Intelligent Information Technologies

Quantified Score

Hi-index	0.00

Visualization

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.