Abstract
The learning strategies often have a direct impact on learning effects. Often, the learning guidance is provided by teachers or experts. With the speed of knowledge renewal going faster and faster, it has been completely unable to meet the needs of the learner due to the limitation of individual time and energy. In order to solve this problem, we propose a learning strategy generation method based on migration between concepts, in which the semantic similarity is creatively applied to measure the relevance of concepts. Moreover, the concept of jump steps is introduced in Wikipedia to measure the difficulty of different learning orders. Based on the hyperlinks in Wikipedia, we build a graph model for the target concepts, and achieve multi-target learning path generation based on the minimum spanning tree algorithm. The test datasets include the books about Computer Science in Wiley database and test sets provided by volunteers. Evaluated by expert scoring and path matching, experimental results show that more than 59% of the 860 single-target learning paths generated by our algorithm are highly recognized by teachers and students. More than 60% of the 500 multi-targets learning paths can match the standard path with 0.7 and above.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lin, C.F., Yeh, Y.C., Hung, Y.H., Chang, R.I.: Data mining for providing a personalized learning path in creativity: an application of decision trees. Comput. Educ. 68, 199–210 (2013)
Lendyuk, T., Melnyk, A., Rippa, S., Golyash, I., Shandruk, S.: Individual learning path building on knowledge-based approach. In: 8th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), pp. 949–954. IEEE, Warsaw (2015)
Zhao, C., Wan, L.: A shortest learning path selection algorithm in e-learning. In: 6th International Conference on Advanced Learning Technologies, pp. 94–95. IEEE, Kerkrade (2006)
Bonifati, A., Ciucanu, R., Lemay, A.: Learning path queries on graph databases. In: 18th International Conference on Extending Database Technology (EDBT), Brussels (2015)
Youmans, G.: A new tool for discourse analysis: the vocabulary-management profile. Language, 763–789 (1991)
Fragkou, P., Petridis, V., Kehagias, A.: A dynamic programming algorithm for linear text segmentation. J. Intell. Inf. Syst. 23(2), 179–197 (2004)
Malioutov, I., Barzilay, R.: Minimum cut model for spoken lecture segmentation. In: 21st International Conference on Computational Linguistics, pp. 25–32. Association for Computational Linguistics, Sydney (2006)
Luo, T., Zhang, L., Yang, L., Chen, X.: TACE: a toolkit for analyzing concept evolution in computing curricula. In: 28th International Conference on Software Engineering and Knowledge Engineering, SEKE, Redwood City (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Liu, D., Zhang, L., Luo, T., Wu, Y. (2017). Learning Path Generation Method Based on Migration Between Concepts. In: Li, G., Ge, Y., Zhang, Z., Jin, Z., Blumenstein, M. (eds) Knowledge Science, Engineering and Management. KSEM 2017. Lecture Notes in Computer Science(), vol 10412. Springer, Cham. https://doi.org/10.1007/978-3-319-63558-3_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-63558-3_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63557-6
Online ISBN: 978-3-319-63558-3
eBook Packages: Computer ScienceComputer Science (R0)