Аноним

Граф путей концептов: различия между версиями

Материал из WikiGrapp

Граф путей концептов (посмотреть исходный код)

Версия от 16:08, 17 января 2017

470 байт добавлено ,  17 января 2017
нет описания правки
Нет описания правки
Нет описания правки
Строка 1: Строка 1:
'''Граф путей концептов''' ([[Concepts_Path_Graph|Concepts Path Graph (CPF)]])
'''Граф путей концептов (ГПК)''' ([[Concepts_Path_Graph|Concepts Path Graph (CPF)]])


'''Граф путей концептов''' is a [[бесконтурный орграф]] that represents a set of sequencing rules which determine the sequence of concepts.
'''Граф путей концептов''' - [[бесконтурный орграф]], который представляет собой множество упорядоченных правил, определяющих последовательность концептов.


'''Граф путей концептов''' 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|directed graph]], that is, a directed graph having no multiple [[node]]s. This means that each concept is contained only once in the '''CPF'''. Additionally, '''CPF''' is an [[Directed_acyclic_graph|acyclic directed graph]], that is, a directed graph containing no directed [[cycle]]s.  
'''Граф путей концептов''' представляет структуру концептов онтологии предметной области, соответствующей рассматриваемой цели обучения. Концепты, содержащиеся в ГПК выбираются основываясь на связи между иерархией целей обучения и онтологией предметной области. Структура ГПК полностью копирует структуру онтологии предметной области. '''CPF''' is a simple [[Directed_graph|directed graph]], that is, a directed graph having no multiple [[node]]s. This means that each concept is contained only once in the '''CPF'''. 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.
Это означает, что в любой возможной последовательности концептов, представленной в ГПК, каждый концепт имеет единственное вхождение.  


[[File:LPG.JPG]]  
[[File:LPG.JPG]]  


==References==
==Литература==
*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.
*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.
*Karampiperis P., Sampson D. Adaptive learning resources sequencing in educational hypermedia systems. — Educational Technology & Society, 8, 4 (2005), 128–147.
*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.
*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.
*Grubišić A., Stankov S., Žitko B. Adaptive Courseware: A Literature Review. — Journal of Universal Computer Science, vol. 21, no. 9 (2015), 1168-1209.
*Grubišić A., Stankov S., Žitko B. Adaptive Courseware: A Literature Review. — Journal of Universal Computer Science, vol. 21, no. 9 (2015), 1168-1209.
Tanya
68

правок

Источник — http://pco.iis.nsk.su/grapp/index.php/Служебная:Сравнение_версий/10642