Concepts Path Graph: различия между версиями

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
Нет описания правки
Нет описания правки
Строка 1: Строка 1:
'''Concepts Path Graph (CPF)''' — граф  
'''Concepts Path Graph (CPF)''' — граф  


'''Concepts Path Graph (CPF)''' is a [[Directed_acyclic_graph|directed acyclic graph]] that represents a set of sequencing rules which determine the sequence of concept.
'''Concepts Path Graph (CPF)''' is a [[Directed_acyclic_graph|directed acyclic graph]] that represents a set of sequencing rules which determine the sequence of concepts.


'''Concepts Path Graph''' represents the structure of the concepts of the Domain Concept Ontology that matches the learning goal in hand.
'''Concepts Path Graph''' represents the structure of the concepts of the Domain Concept Ontology that matches the learning goal in hand.
Строка 10: Строка 10:
Additionally, '''CPF''' is an [[Directed_acyclic_graph|acyclic directed graph]], that is, a directed graph containing no directed [[cycle]]s.  
Additionally, '''CPF''' is an [[Directed_acyclic_graph|acyclic directed graph]], that is, a directed graph containing no directed [[cycle]]s.  
This means that in every possible concept sequence represented by the '''CPF''', each concept has a unique existence.
This means that in every possible concept sequence represented by the '''CPF''', each concept has a unique existence.
we define a concept as an item of knowledge for describing the subject domain and we create a node to represent each concept.
Concept Path Graph: A concept path graph is a
directed acyclic graph that represents the set of
sequencing rules that determine the order of the
concepts; they should be followed by a list of the
behaviors that the instructional designer intends for the
learner to acquire. The learning goals are used to
define the pattern of the concept path based on the
domain model and user model.


==References==
==References==

Версия от 00:43, 22 декабря 2016

Concepts Path Graph (CPF) — граф

Concepts Path Graph (CPF) is a directed acyclic graph that represents a set of sequencing rules which determine the sequence of concepts.

Concepts Path Graph represents the structure of the concepts of the Domain Concept Ontology that matches the learning goal in hand. The concepts contained in the CPF are selected based on the connection between the Learning Goals Hierarchy and the Domain Concept Ontology. The structure of the CPF is directly inherited by the structure of the Domain Concept Ontology. CPF is a simple directed graph, that is, a directed graph having no multiple nodes. This means that each concept is contained only once in the CPF. Additionally, CPF is an acyclic directed graph, that is, a directed graph containing no directed cycles. This means that in every possible concept sequence represented by the CPF, each concept has a unique existence.

we define a concept as an item of knowledge for describing the subject domain and we create a node to represent each concept. Concept Path Graph: A concept path graph is a directed acyclic graph that represents the set of sequencing rules that determine the order of the concepts; they should be followed by a list of the behaviors that the instructional designer intends for the learner to acquire. The learning goals are used to define the pattern of the concept path based on the domain model and user model.

References

  • Karampiperis P., Sampson D. Adaptive learning resources sequencing in educational hypermedia systems. — Educational Technology & Society, 8, 4 (2005), 128–147.
  • Pukkhem N., Evens M.W., Vatanawood W. The Concept Path Combination Model for Supporting a Personalized Learning Path in Adaptive Educational Systems. — In the Proceedings of the 2006 International Conference on e-Learning, e-Business, Enterprise Information Systems, e-Government, and Outsourcing (EEE’06), (2006), 10-16.
  • Carchiolo V., Longheu A., Malgeri M., Mangioni G. Automatic generation of learning paths. — In Proceedings of the 10th IEEE International Conference on Electronics, Circuits and Systems ICECS 2003, IEEE, Vol. 3 (2003), 1236–1239.