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%2F13%3A00070399" target="_blank" >RIV/00216224:14330/13:00070399 - 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 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%.
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
2013
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
Datakon a Znalosti 2013
ISBN
9788024831893
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
133-138
Publisher name
Vysoká škola báňská - Technická univerzita Ostrava
Place of publication
Ostrava
Event location
Ostrava
Event date
Jan 1, 2013
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—