Граф путей концептов

Граф путей концептов (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, 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.

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.
• 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.
• Grubišić A., Stankov S., Žitko B. Adaptive Courseware: A Literature Review. — Journal of Universal Computer Science, vol. 21, no. 9 (2015), 1168-1209.