Informace o publikaci

Graph Mining for Automatic Classification of Logical Proofs

Autoři

VACULÍK Karel POPELÍNSKÝ Lubomír

Rok publikování 2014
Druh Článek ve sborníku
Konference 6th International Conference on Computer Supported Education - CSEDU 2014
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
Obor Informatika
Klíčová slova graph mining; frequent subgraphs; logic proofs; resolution; classification; educational data mining
Popis 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).

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info