Learning Paths Graph: различия между версиями
Tanya (обсуждение | вклад) Нет описания правки |
Tanya (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
The Learning Paths Graph (LPG) is a directed acyclic graph that defines all possible learning paths that match a given learning objective. | The Learning Paths Graph (LPG) is a [[Directed_acyclic_graph|directed acyclic graph]] that defines all possible learning paths that match a given learning objective. | ||
Learning Paths Graph is a directed graph which represents all possible learning paths (sequence of learning resources) that matches the learning goal in hand. | Learning Paths Graph is a directed graph which represents all possible learning paths (sequence of learning resources) that matches the learning goal in hand. | ||
To construct the LPG, for each concept of the CPF related learning resources are selected from the Media Space based on the connection between the Domain Concept Ontology and the Resource Description Model. | To construct the LPG, for each concept of the [[Concepts_Path_Graph|Concepts Path Graph (CPF)]] related learning resources are selected from the Media Space based on the connection between the Domain Concept Ontology and the Resource Description Model. | ||
Each node in the CPF is then replaced by the related set of learning resources retrieved from the Media Space. | Each node in the [[Concepts_Path_Graph|CPF]]is then replaced by the related set of learning resources retrieved from the Media Space. | ||
The structure of the learning resources set is directly inherited by the structure of the Media Space. | The structure of the learning resources set is directly inherited by the structure of the Media Space. | ||
The final graph is the Learning Paths Graph. Assuming that the Media Space does not contain circular references between learning resources, the LPG is again a simple acyclic | The final graph is the Learning Paths Graph. Assuming that the Media Space does not contain circular references between learning resources, the LPG is again a simple acyclic | ||
Версия от 00:05, 22 декабря 2016
The Learning Paths Graph (LPG) is a directed acyclic graph that defines all possible learning paths that match a given learning objective.
Learning Paths Graph is a directed graph which represents all possible learning paths (sequence of learning resources) that matches the learning goal in hand. To construct the LPG, for each concept of the Concepts Path Graph (CPF) related learning resources are selected from the Media Space based on the connection between the Domain Concept Ontology and the Resource Description Model. Each node in the CPFis then replaced by the related set of learning resources retrieved from the Media Space. The structure of the learning resources set is directly inherited by the structure of the Media Space. The final graph is the Learning Paths Graph. Assuming that the Media Space does not contain circular references between learning resources, the LPG is again a simple acyclic directed graph. Although this assumption does not directly affect either the design of an AEHS, nor our sequencing methodology, it is necessary for avoiding infinite learning paths.
References
- Karampiperis P., Sampson D. Adaptive learning resources sequencing in educational hypermedia systems. — Educational Technology & Society, 8, 4 (2005), 128–147.