New Features of ScanGraph - a Tool for Revealing Participants’ Strategy from Eye-movement Data

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F18%3A73587380" target="_blank" >RIV/61989592:15310/18:73587380 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1145/3204493.3208334" target="_blank" >http://dx.doi.org/10.1145/3204493.3208334</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3204493.3208334" target="_blank" >10.1145/3204493.3208334</a>

Jazyk výsledku

angličtina

Název v původním jazyce

New Features of ScanGraph - a Tool for Revealing Participants’ Strategy from Eye-movement Data

Popis výsledku v původním jazyce

The demo describes new features of ScanGraph, an application intended for a finding of participants with a similar stimulus reading strategy based on the sequences of visited Areas of Interest. The result is visualised using cliques of a simple graph. ScanGraph was initially introduced in 2016. Since the original publication, new features were added. First of them is the implementation of Damerau-Levenshtein algorithm for similarity calculation. A heuristic algorithm for cliques finding used in the original version was replaced by the Bron-Kerbosch algorithm. ScanGraph reads data from open-source application OGAMA, and with the use of conversion tool also data from SMI BeGaze, which allows analysing dynamic stimuli as well. The most prominent enhancement is the possibility of similarity calculation among participants not only for a single stimulus but for multiple files at once.

Název v anglickém jazyce

New Features of ScanGraph - a Tool for Revealing Participants’ Strategy from Eye-movement Data

Popis výsledku anglicky

The demo describes new features of ScanGraph, an application intended for a finding of participants with a similar stimulus reading strategy based on the sequences of visited Areas of Interest. The result is visualised using cliques of a simple graph. ScanGraph was initially introduced in 2016. Since the original publication, new features were added. First of them is the implementation of Damerau-Levenshtein algorithm for similarity calculation. A heuristic algorithm for cliques finding used in the original version was replaced by the Bron-Kerbosch algorithm. ScanGraph reads data from open-source application OGAMA, and with the use of conversion tool also data from SMI BeGaze, which allows analysing dynamic stimuli as well. The most prominent enhancement is the possibility of similarity calculation among participants not only for a single stimulus but for multiple files at once.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

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ů

Název statě ve sborníku

ETRA ’18: 2018 Symposium on Eye Tracking Research and Applications

ISBN

978-1-4503-5706-7

ISSN

—

e-ISSN

neuvedeno

Počet stran výsledku

2

Strana od-do

"103-1"-"103-2"

Název nakladatele

Association for Computing Machinery

Místo vydání

New York

Místo konání akce

Warszawa

Datum konání akce

14. 6. 2018

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—