Abstract
In this paper, we introduce a method to estimate the degree of students’ understanding of concepts and relationships while they learn from digital text materials online. To achieve our goal, we first define a semantic network that represents the knowledge in a material. Second, we define students’ behavior as the sequence of relationships they read in the material, and we create a probabilistic model for relationship understanding. We also create inference rules to include new relationships in the network. Third, we simulate the propagation of the new concept understanding through the network by using a method based on Biased PageRank, extending it with a method to represent prior knowledge and weighting the contribution of every concept according to the uniqueness of its relationships. Finally, we describe an experiment to compare our method against a method without propagation and a method in which propagation is inversely proportional to the distance between concepts. Our method shows significant improvement compared to the others, providing evidence that propagation of concept understanding through the entire network exists.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Moodle. https://www.moodle.org. Accessed 15 Jan 2017
Dagger, D., Conlan, O., Wade, V.: Fundamental requirements of personalised eLearning development environments. In: World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education (2005)
Kaplan, A.M., Haenlein, M.: Higher education and the digital revolution: about MOOCs, SPOCs, social media, and the Cookie Monster. Bus. Horiz. 59(4), 441–450 (2016)
Marzano, R.J., Kendall, J.S.: The New Taxonomy of Educational Objectives. Corwin Press, Thousand Oaks (2007)
Gagné, R.M.: The Conditions of Learning and Theory of Instruction. Holt, Rinehart and Winston, New York (1985)
Zentall, T.R., Galizio, M., Critchfied, T.S.: Categorization, concept learning, and behavior analysis: an introduction. J. Exp. Anal. Behav. 78(3), 237–248 (2002)
Piaget, J.: L’equilibration des structures cognitives: Problème central du développement. Presses Universitaires de France (1975)
Vygotsky, L.S.: Interaction between learning and development. In: Mind in Society, pp. 79–91. Harvard University Press, Cambridge (1978)
Gyöngyi, Z., Garcia-Molina, H., Pedersen, J.: Combating web spam with TrustRank. In: Proceedings of the 30th VLDB Conference, pp. 576–587 (2004)
Shahiri, A.M., Husain, W., Rashid, N.A.: A review on predicting student’s performance using data mining techniques. In: The Third Information Systems International Conference (2015). Procedia Comput. Sci. 72, 414–422 (2015)
Thakar, P., Mehta, A., Manisha: Performance analysis and prediction in educational data mining: a research travelogue. Int. J. Comput. Appl. 110(15), 60–68 (2015)
Kabakchieva, D.: Predicting student performance by using data mining methods for classification. Cybern. Inf. Technol. 13(1), 61–71 (2013)
Kotsiantis, S., Pierrakeas, C., Pintelas, P.: Prediction of student’s performance in distance learning using machine learning techniques. Appl. Artif. Intell. 18(5), 411–426 (2004)
Dekker, G.W., Pechenizkiy, M., Vleeshouwers, J.M.: Predicting students drop out: a case study. In: Proceedings of 2nd International Conference on Educational Data Mining, pp. 41–50 (2009)
Corbett, A.T., Anderson, J.R.: Knowledge tracing: modeling the acquisition of procedural knowledge. User Model. User-Adap. Inter. 4(4), 253–278 (1995)
Cen, H., Koedinger, K., Junker, B.: Learning factors analysis – a general method for cognitive model evaluation and improvement. In: Ikeda, M., Ashley, K.D., Chan, T.-W. (eds.) ITS 2006. LNCS, vol. 4053, pp. 164–175. Springer, Heidelberg (2006). doi:10.1007/11774303_17
Williams, C., D’Mello, S.: Predicting student knowledge level from domain-independent function and content words. In: Aleven, V., Kay, J., Mostow, J. (eds.) ITS 2010. LNCS, vol. 6095, pp. 62–71. Springer, Heidelberg (2010). doi:10.1007/978-3-642-13437-1_7
Fuchs, L.S., Fuchs, D., Hosp, M.K.: Oral reading fluency as an indicator of reading competency: a theoretical, empirical and historical analysis. Sci. Stud. Read. 5(3), 239–256 (2001)
Copeland, L., Gedeon, T., Mendis, S.: Predicting reading comprehension scores from eye movements using artificial neural networks and fuzzy output error. Artif. Intell. Res. 3(3), 35–48 (2014)
Sowa, J.F.: Semantic networks. In: Shapiro, S.C. (ed.) Encyclopedia of Artificial Intelligence (1987)
Sowa, J.F.: Conceptual graphs for a data base interface. IBM J. Res. Dev. 20(4), 336–357 (1976)
Prediger, S.: Simple concept graphs: a logic approach. In: Mugnier, M.-L., Chein, M. (eds.) ICCS-ConceptStruct 1998. LNCS, vol. 1453, pp. 225–239. Springer, Heidelberg (1998). doi:10.1007/BFb0054917
Van der Riet, R.P., Meersman, R.A.: Linguistic Instruments in Knowledge Engineering. Imprint Elsevier Science Ltd., New York (1992)
Mesquita, F., Schmidek, J., Barbosa, D.: Effectiveness and efficiency of open relation extraction. In: Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, pp. 447–457 (2013)
Atzeni, P., Parker Jr., D.S.: Set containment inference and syllogisms. Theor. Comput. Sci. 62(1–2), 39–65 (1988)
Golub, G.H., Van Loan, C.F.: Matrix Computations. The Johns Hopkins University Press, Baltimore (1996)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical report. Stanford InfoLab (1999)
Lancers. http://www.lancers.jp. Accessed 09 Jan 2017
Word frequency data. http://www.wordfrequency.info. Accessed 31 Jan 2017
Cohen, J.: Weighted kappa: nominal scale agreement with provision for scaled disagreement or partial credit. Psychol. Bull. 70(4), 213–220 (1968)
Lenhard, W., Lenhard, A.: Hypothesis Tests for Comparing Correlations (2014). https://www.psychometrica.de/correlation.html. Accessed 15 Mar 2017
Eid, M., Gollwitzer, M., Schmitt, M.: Statistik und Forschungsmethoden Lehrbuch. Beltz, Weinheim (2011). (in German)
Holm, S.: A simple sequentially rejective multiple test procedure. Scand. J. Stat. 6(2), 65–70 (1979)
Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia (2000). ISBN 0-89871-454-0
Acknowledgements
This work was supported by JSPS KAKENHI Grant Numbers JP15H01718 and JP26700009.
We would also like to thank Profs. Masatoshi Yoshikawa and Roi Blanco for their inestimable advice to develop this research.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Appendix
Appendix
In order to prove the convergence of our method, we remind that in case of having an iterative method with transition matrix M, convergence is proven if \( \lim_{y \to \infty } {\mathbf{M}}^{y} {\mathbf{u}} = {\mathbf{u}} \). Equivalently, to grant we will achieve a steady state distribution, we need to ensure that the biggest dominant eigenvalue of M is 1. In our case, we need to verify \( \alpha {\mathbf{Du}} + \left( {1 - \alpha } \right){\mathbf{k}} = {\mathbf{u}} \). If we rewrite this equation as \( {\mathbf{u}} = {\mathbf{Mu}} \), and we let S be the matrix that verifies s ii = pk(c i ) and s ij = 0 for i ≠ j, we have that \( {\mathbf{M}} = \alpha {\mathbf{D}} + \left( {1 - \alpha } \right){\mathbf{S}} \). Since it is difficult to prove that the dominant eigenvalue of M is 1, we will prove that the dominant eigenvalue for M T is 1 instead. Then, we can use the Perron-Frobenius theorem, which states that the dominant eigenvalue is the same for M and M T. We remember that in the concepts where the prior knowledge had been set, we had established that rund(r ii ,t) = 1 and rund(r ij ,t) = 0 for all j ≠ i. By using this, we can see that the dominant eigenvector u for the matrix M T is precisely k, the vector representing prior knowledge and the eigenvalue for that vector is 1.
As in the case of the original PageRank [27], convergence of is only granted if the transition matrix is (1) irreducible and (2) aperiodic. We know that matrices verifying that one diagonal element is non-zero are aperiodic [34]. This is our case because we had set the pk(c i ) for at least one concept c i and we also stated that in such case rund(r ii ,t) = w ii = 1 for all t. The problem is that the transition matrix is not irreducible because we allowed rund(r ij ,t) = 0 for all j in a concept whose prior knowledge has not been set. However, by using the principle “each relationship has its inverse” in Sect. 3.1, we have that if rund(r ij ,t) = 0, then rund(r ji ,t) = 0 too, so the concept c i is completely isolated from the rest of the graph. In that case, we can just set u(c i ,t) = 0 for all t, and we can remove the concept from the graph, having that the remaining graph is strongly connected and therefore its matrix is irreducible.
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
López-García, R., Kato, M.P., Tanaka, K. (2017). A Propagation-Based Method of Estimating Students’ Concept Understanding. In: Ciampaglia, G., Mashhadi, A., Yasseri, T. (eds) Social Informatics. SocInfo 2017. Lecture Notes in Computer Science(), vol 10539. Springer, Cham. https://doi.org/10.1007/978-3-319-67217-5_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-67217-5_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67216-8
Online ISBN: 978-3-319-67217-5
eBook Packages: Computer ScienceComputer Science (R0)