Proposed Optimal Growth Pathfinding Method Based on Growth Trajectories

Proposed Optimal Growth Pathfinding Method Based on Growth Trajectories

Niu Woyuan, Ryosuke Saga, Hiroshi Tsuji, Yukie Majima
Copyright: © 2015 |Pages: 20
DOI: 10.4018/IJKSS.2015100105
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In this study, the authors propose an optimal growth pathfinding method to support learners in effectively mastering a set of capabilities. Under the assumption of prerequisite relationships among learning objectives, the main processes of the method are as follows: (1) extracting the capability structure from growth trajectories, (2) remodeling the problem as a traveling salesman problem with restrictions among learning objectives, and (3) generating the cost matrix and obtaining the optimal growth path. In addition, a flexible approach to data standardization as a step of capability structure extraction is discussed. The proposed method is also applied to a software engineer growth dataset with 30 responders.
Article Preview
Top

The formal concepts of capability space and capability structure are derived from the analogy of KST (Doignon & Falmagne, 1985). The basic concepts of KST and the definitions proposed by Tsuji et al. (2013) will be briefly discussed. Doignon and Falmagne (1985) proposed the KST, which provides a formal means to describe the structure of a given domain of knowledge. Knowledge state is a set of knowledge items (problem) that an individual is able to solve. Prerequisite relationships (also formalized by surmised relationships) between knowledge items restrict the set of possible knowledge states. The set of all possible knowledge states is called a knowledge space (Stahl, 2011).

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing