Graph Mining for Automatic Classification of Logical Proofs

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00070399" target="_blank" >RIV/00216224:14330/13:00070399 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Graph Mining for Automatic Classification of Logical Proofs
Popis výsledku v původním jazyce
We introduce a new system that employs graph mining methods for evaluation of logical proofs constructed by undergraduate students. First, the source data are described. 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 present a new system for graph mining that uses generalized frequent patterns as new attributes. We show that both overall accuracy and precision forincorrect resolution proofs overcome 97%.
Název v anglickém jazyce
Graph Mining for Automatic Classification of Logical Proofs
Popis výsledku anglicky
We introduce a new system that employs graph mining methods for evaluation of logical proofs constructed by undergraduate students. First, the source data are described. 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 present a new system for graph mining that uses generalized frequent patterns as new attributes. We show that both overall accuracy and precision forincorrect resolution proofs overcome 97%.

Rok uplatnění
2013
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)