%0 Book Section %1 citeulike:13530530 %A Rivers, Kelly %A Koedinger, KennethR %B Intelligent Tutoring Systems %D 2014 %E Trausan-Matu, Stefan %E Boyer, KristyElizabeth %E Crosby, Martha %E Panourgia, Kitty %I Springer International Publishing %K program-analysis progtutor similarity %P 329--339 %R 10.1007/978-3-319-07221-0_41 %T Automating Hint Generation with Solution Space Path Construction %U http://dx.doi.org/10.1007/978-3-319-07221-0_41 %V 8474 %X Developing intelligent tutoring systems from student solution data is a promising approach to facilitating more widespread application of tutors. In principle, tutor feedback can be generated by matching student solution attempts to stored intermediate solution states, and next-step hints can be generated by finding a path from a student's current state to a correct solution state. However, exact matching of states and paths does not work for many domains, like programming, where the number of solution states and paths is too large to cover with data. It has previously been demonstrated that the state space can be substantially reduced using canonicalizing operations that abstract states. In this paper, we show how solution paths can be constructed from these abstract states that go beyond the paths directly observed in the data. We describe a domain-independent algorithm that can automate hint generation through use of these paths. Through path construction, less data is needed for more complete hint generation. We provide examples of hints generated by this algorithm in the domain of programming.

@incollection{citeulike:13530530, abstract = {{Developing intelligent tutoring systems from student solution data is a promising approach to facilitating more widespread application of tutors. In principle, tutor feedback can be generated by matching student solution attempts to stored intermediate solution states, and next-step hints can be generated by finding a path from a student's current state to a correct solution state. However, exact matching of states and paths does not work for many domains, like programming, where the number of solution states and paths is too large to cover with data. It has previously been demonstrated that the state space can be substantially reduced using canonicalizing operations that abstract states. In this paper, we show how solution paths can be constructed from these abstract states that go beyond the paths directly observed in the data. We describe a domain-independent algorithm that can automate hint generation through use of these paths. Through path construction, less data is needed for more complete hint generation. We provide examples of hints generated by this algorithm in the domain of programming.}}, added-at = {2018-03-19T12:24:51.000+0100}, author = {Rivers, Kelly and Koedinger, KennethR}, biburl = {https://www.bibsonomy.org/bibtex/2cfdf7f2312cd4c8958ee7bb3a4240144/aho}, booktitle = {Intelligent Tutoring Systems}, citeulike-article-id = {13530530}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-319-07221-0_41}, citeulike-linkout-1 = {http://link.springer.com/chapter/10.1007/978-3-319-07221-0_41}, doi = {10.1007/978-3-319-07221-0_41}, editor = {Trausan-Matu, Stefan and Boyer, KristyElizabeth and Crosby, Martha and Panourgia, Kitty}, interhash = {721c179eb8a842e0733d99d926b59dad}, intrahash = {cfdf7f2312cd4c8958ee7bb3a4240144}, keywords = {program-analysis progtutor similarity}, pages = {329--339}, posted-at = {2015-03-01 17:19:48}, priority = {2}, publisher = {Springer International Publishing}, series = {Lecture Notes in Computer Science}, timestamp = {2018-03-19T12:24:51.000+0100}, title = {{Automating Hint Generation with Solution Space Path Construction}}, url = {http://dx.doi.org/10.1007/978-3-319-07221-0_41}, volume = 8474, year = 2014 }