About: Graph Mining and Outlier Detection Meet Logic Proof Tutoring

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Graph Mining and Outlier Detection Meet Logic Proof Tutoring Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	We introduce a new method for analysis and evaluation of logic proofs constructed by undergraduate students, e.g. resolution or tableaux proofs. This method employs graph mining and outlier detection. The data has been obtained from a web-based system for input of logic proofs built at FI MU. The data contains a tree structure of the proof and also temporal information about all actions that a student performed, e.g. a node insertion into a proof, or its deletion, drawing or deletion of an edge, or text manipulations. We introduce a new method for multi-level generalization of subgraphs that is useful for characterization of logic proofs. We use this method for feature construction and perform class-based outlier detection on logic proofs represented by these new features. We show that this method helps to find unusual students' solutions and to improve semi-automatic evaluation of the solutions. We introduce a new method for analysis and evaluation of logic proofs constructed by undergraduate students, e.g. resolution or tableaux proofs. This method employs graph mining and outlier detection. The data has been obtained from a web-based system for input of logic proofs built at FI MU. The data contains a tree structure of the proof and also temporal information about all actions that a student performed, e.g. a node insertion into a proof, or its deletion, drawing or deletion of an edge, or text manipulations. We introduce a new method for multi-level generalization of subgraphs that is useful for characterization of logic proofs. We use this method for feature construction and perform class-based outlier detection on logic proofs represented by these new features. We show that this method helps to find unusual students' solutions and to improve semi-automatic evaluation of the solutions. (en)
Title	Graph Mining and Outlier Detection Meet Logic Proof Tutoring Graph Mining and Outlier Detection Meet Logic Proof Tutoring (en)
skos:prefLabel	Graph Mining and Outlier Detection Meet Logic Proof Tutoring Graph Mining and Outlier Detection Meet Logic Proof Tutoring (en)
skos:notation	RIV/00216224:14330/14:00076475!RIV15-MSM-14330___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Nezvalová, Leona Vaculík, Karel Popelínský, Lubomír
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	18568
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/14:00076475
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	logic proofs; resolution; educational data mining; graph mining; outlier detection (en)
http://linked.open.../riv/klicoveSlovo	educational data mining outlier detection resolution graph mining logic proofs
http://linked.open...ontrolniKodProRIV	[9E042BCF31FF]
http://linked.open...v/mistoKonaniAkce	London, United Kingdom
http://linked.open...i/riv/mistoVydani	London
http://linked.open...i/riv/nazevZdroje	Proceedings of EDM 2014 Ws Graph-based Educational Data Mining (G-EDM)
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Popelínský, Lubomír Vaculík, Karel Nezvalová, Leona
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-07-04 (xsd:date)
issn	1613-0073
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	CEUR-WS.org
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.116 as of Feb 22 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3239 as of Feb 22 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 81 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software