Approximate Graph Matching for Mistake-tolerant Skill Assessment | SRI International

Toggle Menu

Approximate Graph Matching for Mistake-tolerant Skill Assessment

January, 2017
Melinda Gervasio and Christian Jones and Karen Myers
Citation 
Melinda Gervasio and Christian Jones and Karen Myers. Approximate Graph Matching for Mistake-tolerant Skill Assessment, in Advances in Cognitive Systems, vol. 5, 2017.
Abstract 
This paper presents an approach to automated assessment for online training based on approximate graph matching. The algorithm lies at the core of two prototype training systems that we have built in accord with U.S. Army training materials: one for the use of a collaborative visualization and planning tool, the other for rifle maintenance. The algorithm uses approximate graph-matching techniques to align a representation of a student response for a training exercise with a predefined solution model for the exercise. The approximate matching enables tolerance to learner mistakes, with deviations in the alignment providing the basis for feedback that is presented to the student. Given that graph matching is NP-complete, the algorithm uses a heuristic approach to balance computational performance with alignment quality. A comprehensive experimental evaluation shows that our technique scales well while retaining the ability to identify correct alignments for responses containing realistic types and numbers of learner mistakes. Keywords: Artificial Intelligence, Artificial Intelligence Center, AIC
In Proceedings
Search Publications
Browse by Sectors
Archive
E.g., 2018-09-19
E.g., 2018-09-19
Author