User Tools

Site Tools


ast-patterns:start

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
ast-patterns:start [2018/06/18 20:00]
timotej
ast-patterns:start [2018/06/19 23:02]
timotej
Line 19: Line 19:
 The alternative would be to generate automatic feedback, however  The alternative would be to generate automatic feedback, however 
 this would require teachers to specify all possible errors made by students.  this would require teachers to specify all possible errors made by students. 
-Instead we propose a data-driven algorithm for identification of typical approaches and errors. We present the problem as supervised rule learning, where each learned rule can be used as a hint to a student. To learn rules, we use programs submitted by students as learning instances that are classified either as correct or incorrect solutions. The attributes for machine learning correspond to patterns from an abstract syntax tree. As the space of patterns is immense and we wish to use only meaningful patterns, we used the argument-based machine learning (ABML) process, where an expert and ABML interactively exchange arguments until the model is good enough. We provide a step-by-step demonstration of the ABML process, describe some of the induced rules and explain how are they used to automatically generate hints to students. Finally, we evaluate classification accuracy of learned rules on 42 Prolog exercises from the Programming Languages Course at University of Ljubljana. 
  
 +Instead we propose a data-driven algorithm for identification of typical approaches and errors. We present the problem as supervised rule learning, where each learned rule can be used as a hint to a student. To learn rules, we use programs submitted by students as learning instances that are classified either as correct or incorrect solutions. The attributes for machine learning correspond to patterns from an abstract syntax tree.
 +
 +As the space of patterns is immense and we wish to use only meaningful patterns, we used the argument-based machine learning (ABML) process, where an expert and ABML interactively exchange arguments until the model is good enough. We provide a step-by-step demonstration of the ABML process, describe some of the induced rules and explain how are they used to automatically generate hints to students. Finally, we evaluate classification accuracy of learned rules on 42 Prolog exercises from the Programming Languages Course at University of Ljubljana.
 +
 +  * {{:papers:abcn2_knowledge_acquisition.pdf|Paper}}
   * {{:papers:ABCN2e.pdf|ABCN2e: an extension of ABCN2 (white paper)}}   * {{:papers:ABCN2e.pdf|ABCN2e: an extension of ABCN2 (white paper)}}
   * [[https://github.com/martinmozina/orange3-abml |Implementation of ABCN2e as an Orange 3 add-on]]   * [[https://github.com/martinmozina/orange3-abml |Implementation of ABCN2e as an Orange 3 add-on]]
ast-patterns/start.txt · Last modified: 2019/02/11 18:51 by timotej