Publication details

Graph Mining for Automatic Classification of Logical Proofs

Authors

VACULÍK Karel POPELÍNSKÝ Lubomír

Year of publication 2014
Type Article in Proceedings
Conference 6th International Conference on Computer Supported Education - CSEDU 2014
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords graph mining; frequent subgraphs; logic proofs; resolution; classification; educational data mining
Description We introduce graph mining for evaluation of logical proofs constructed by undergraduate students in the introductory course of logic. We start with description of the source data and their transformation into GraphML. As particular tasks may differ---students solve different tasks---we introduce a method for unification of resolution steps that enables to generate generalized frequent subgraphs. We then introduce a new system for graph mining that uses generalized frequent patterns as new attributes. We show that both overall accuracy and precision for incorrect resolution proofs overcome 97%. We also discuss a use of emergent patterns and three-class classification (correct/incorrect/unrecognised).

You are running an old browser version. We recommend updating your browser to its latest version.

More info