Graph Mining for Automatic Classification of Logical Proofs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F14%3A00076476" target="_blank" >RIV/00216224:14330/14:00076476 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Graph Mining for Automatic Classification of Logical Proofs
Original language 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. Weshow 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).
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
6th International Conference on Computer Supported Education - CSEDU 2014
ISBN
9789897580208
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
268-275
Publisher name
2014 SCITEPRESS ? Science and Technology Publications
Place of publication
Portugal
Event location
Barcelona, Spain
Event date
Apr 1, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—