68
правок
Concepts Path Graph: различия между версиями
Перейти к навигации
Перейти к поиску
нет описания правки
Tanya (обсуждение | вклад) (Новая страница: «Concepts Path Graph (CPF) is a directed acyclic graph that represents a set of sequencing rules which determine the sequence of concept. Concepts Path Graph rep…») |
Tanya (обсуждение | вклад) Нет описания правки |
||
| Строка 9: | Строка 9: | ||
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. | ||
==References== | |||
Karampiperis | *Karampiperis P., Sampson D. Adaptive learning resources sequencing in educational hypermedia systems. — Educational Technology & Society, 8, 4 (2005), 128–147 | ||
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. | |||
Pukkhem | |||
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 | |||
In Proceedings of the 10th IEEE International Conference on Electronics, Circuits and Systems ICECS 2003, IEEE, Vol. 3 (2003), 1236–1239 | |||