Event-Based Dynamic Graph Visualisation

Simonetto, Paolo; Archambault, Daniel; Kobourov, Stephen G.

doi:10.1109/TVCG.2018.2886901

Journal article 918 views 325 downloads

Event-Based Dynamic Graph Visualisation

Paolo Simonetto, Daniel Archambault

, Stephen G. Kobourov

IEEE Transactions on Visualization and Computer Graphics, Pages: 1 - 1

Swansea University Author: Daniel Archambault

PDF | Accepted Manuscript

Embargo date to allow accepted preprint to go live on IEEE Explore
Download (1.74MB)
PDF | Version of Record

Released under the terms of a Creative Commons Attribution 3.0 License (CC-BY).
Download (1.7MB)

Check full text

DOI (Published version): 10.1109/TVCG.2018.2886901

Abstract

Dynamic graph drawing algorithms take as input a series of timeslices that standard, force-directed algorithms can exploit to compute a layout. However, often dynamic graphs are expressed as a series of events where the nodes and edges have real coordinates along the time dimension that are not conf...

Full description

Published in:	IEEE Transactions on Visualization and Computer Graphics
ISSN:	1077-2626 1941-05062160-9306
Published:	2018
Online Access:	Check full text
URI:	https://cronfa.swan.ac.uk/Record/cronfa47911
Tags:	Add Tag No Tags, Be the first to tag this record!

first_indexed	2018-12-09T20:25:45Z
last_indexed	2021-01-29T04:08:34Z
id	cronfa47911
recordtype	SURis
fullrecord	<?xml version="1.0"?><rfc1807><datestamp>2021-01-28T16:28:17.7075456</datestamp><bib-version>v2</bib-version><id>47911</id><entry>2018-12-09</entry><title>Event-Based Dynamic Graph Visualisation</title><swanseaauthors><author><sid>8fa6987716a22304ef04d3c3d50ef266</sid><ORCID>0000-0003-4978-8479</ORCID><firstname>Daniel</firstname><surname>Archambault</surname><name>Daniel Archambault</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2018-12-09</date><deptcode>SCS</deptcode><abstract>Dynamic graph drawing algorithms take as input a series of timeslices that standard, force-directed algorithms can exploit to compute a layout. However, often dynamic graphs are expressed as a series of events where the nodes and edges have real coordinates along the time dimension that are not confined to discrete timeslices. Current techniques for dynamic graph drawing impose a set of timeslices on this event-based data in order to draw the dynamic graph, but it is unclear how many timeslices should be selected: too many timeslices slows the computation of the layout, while too few timeslices obscures important temporal features, such as causality. To address these limitations, we introduce a novel model for drawing event-based dynamic graphs and the first dynamic graph drawing algorithm, DynNoSlice, that is capable of drawing dynamic graphs in this model. DynNoSlice is an offline, force-directed algorithm that draws event-based, dynamic graphs in the space-time cube (2D+time). We also present a method to extract representative small multiples from the space-time cube. To demonstrate the advantages of our approach, DynNoSlice is compared with state-of-the-art timeslicing methods using a metrics-based experiment. Finally, we present case studies of event-based dynamic data visualised with the new model and algorithm.</abstract><type>Journal Article</type><journal>IEEE Transactions on Visualization and Computer Graphics</journal><volume/><journalNumber/><paginationStart>1</paginationStart><paginationEnd>1</paginationEnd><publisher/><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>1077-2626</issnPrint><issnElectronic>1941-05062160-9306</issnElectronic><keywords>Information Visualisation, Graph Drawing, Dynamic Graphs, Event-Based Analytics, No Timeslices.</keywords><publishedDay>18</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2018</publishedYear><publishedDate>2018-12-18</publishedDate><doi>10.1109/TVCG.2018.2886901</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><degreesponsorsfunders>EPSRC Grant EP/N005724/1, NSF Grants CCF-1712119, CCF-1740858, DMS-1839274</degreesponsorsfunders><apcterm/><funders>UKRI, EP/N005724/1</funders><lastEdited>2021-01-28T16:28:17.7075456</lastEdited><Created>2018-12-09T16:51:17.4743705</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Paolo</firstname><surname>Simonetto</surname><order>1</order></author><author><firstname>Daniel</firstname><surname>Archambault</surname><orcid>0000-0003-4978-8479</orcid><order>2</order></author><author><firstname>Stephen G.</firstname><surname>Kobourov</surname><order>3</order></author></authors><documents><document><filename>0047911-09122018165823.pdf</filename><originalFilename>visualNoTS.pdf</originalFilename><uploaded>2018-12-09T16:58:23.3430000</uploaded><type>Output</type><contentLength>1729158</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2019-01-15T00:00:00.0000000</embargoDate><documentNotes>Embargo date to allow accepted preprint to go live on IEEE Explore</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language></document><document><filename>0047911-04012019133227.pdf</filename><originalFilename>47911.pdf</originalFilename><uploaded>2019-01-04T13:32:27.3070000</uploaded><type>Output</type><contentLength>1756392</contentLength><contentType>application/pdf</contentType><version>Version of Record</version><cronfaStatus>true</cronfaStatus><embargoDate>2019-01-03T00:00:00.0000000</embargoDate><documentNotes>Released under the terms of a Creative Commons Attribution 3.0 License (CC-BY).</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807>
spelling	2021-01-28T16:28:17.7075456 v2 47911 2018-12-09 Event-Based Dynamic Graph Visualisation 8fa6987716a22304ef04d3c3d50ef266 0000-0003-4978-8479 Daniel Archambault Daniel Archambault true false 2018-12-09 SCS Dynamic graph drawing algorithms take as input a series of timeslices that standard, force-directed algorithms can exploit to compute a layout. However, often dynamic graphs are expressed as a series of events where the nodes and edges have real coordinates along the time dimension that are not confined to discrete timeslices. Current techniques for dynamic graph drawing impose a set of timeslices on this event-based data in order to draw the dynamic graph, but it is unclear how many timeslices should be selected: too many timeslices slows the computation of the layout, while too few timeslices obscures important temporal features, such as causality. To address these limitations, we introduce a novel model for drawing event-based dynamic graphs and the first dynamic graph drawing algorithm, DynNoSlice, that is capable of drawing dynamic graphs in this model. DynNoSlice is an offline, force-directed algorithm that draws event-based, dynamic graphs in the space-time cube (2D+time). We also present a method to extract representative small multiples from the space-time cube. To demonstrate the advantages of our approach, DynNoSlice is compared with state-of-the-art timeslicing methods using a metrics-based experiment. Finally, we present case studies of event-based dynamic data visualised with the new model and algorithm. Journal Article IEEE Transactions on Visualization and Computer Graphics 1 1 1077-2626 1941-05062160-9306 Information Visualisation, Graph Drawing, Dynamic Graphs, Event-Based Analytics, No Timeslices. 18 12 2018 2018-12-18 10.1109/TVCG.2018.2886901 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University EPSRC Grant EP/N005724/1, NSF Grants CCF-1712119, CCF-1740858, DMS-1839274 UKRI, EP/N005724/1 2021-01-28T16:28:17.7075456 2018-12-09T16:51:17.4743705 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Paolo Simonetto 1 Daniel Archambault 0000-0003-4978-8479 2 Stephen G. Kobourov 3 0047911-09122018165823.pdf visualNoTS.pdf 2018-12-09T16:58:23.3430000 Output 1729158 application/pdf Accepted Manuscript true 2019-01-15T00:00:00.0000000 Embargo date to allow accepted preprint to go live on IEEE Explore true eng 0047911-04012019133227.pdf 47911.pdf 2019-01-04T13:32:27.3070000 Output 1756392 application/pdf Version of Record true 2019-01-03T00:00:00.0000000 Released under the terms of a Creative Commons Attribution 3.0 License (CC-BY). true eng
title	Event-Based Dynamic Graph Visualisation
spellingShingle	Event-Based Dynamic Graph Visualisation Daniel Archambault
title_short	Event-Based Dynamic Graph Visualisation
title_full	Event-Based Dynamic Graph Visualisation
title_fullStr	Event-Based Dynamic Graph Visualisation
title_full_unstemmed	Event-Based Dynamic Graph Visualisation
title_sort	Event-Based Dynamic Graph Visualisation
author_id_str_mv	8fa6987716a22304ef04d3c3d50ef266
author_id_fullname_str_mv	8fa6987716a22304ef04d3c3d50ef266_***_Daniel Archambault
author	Daniel Archambault
author2	Paolo Simonetto Daniel Archambault Stephen G. Kobourov
format	Journal article
container_title	IEEE Transactions on Visualization and Computer Graphics
container_start_page	1
publishDate	2018
institution	Swansea University
issn	1077-2626 1941-05062160-9306
doi_str_mv	10.1109/TVCG.2018.2886901
college_str	Faculty of Science and Engineering
hierarchytype
hierarchy_top_id	facultyofscienceandengineering
hierarchy_top_title	Faculty of Science and Engineering
hierarchy_parent_id	facultyofscienceandengineering
hierarchy_parent_title	Faculty of Science and Engineering
department_str	School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str	1
active_str	0
description	Dynamic graph drawing algorithms take as input a series of timeslices that standard, force-directed algorithms can exploit to compute a layout. However, often dynamic graphs are expressed as a series of events where the nodes and edges have real coordinates along the time dimension that are not confined to discrete timeslices. Current techniques for dynamic graph drawing impose a set of timeslices on this event-based data in order to draw the dynamic graph, but it is unclear how many timeslices should be selected: too many timeslices slows the computation of the layout, while too few timeslices obscures important temporal features, such as causality. To address these limitations, we introduce a novel model for drawing event-based dynamic graphs and the first dynamic graph drawing algorithm, DynNoSlice, that is capable of drawing dynamic graphs in this model. DynNoSlice is an offline, force-directed algorithm that draws event-based, dynamic graphs in the space-time cube (2D+time). We also present a method to extract representative small multiples from the space-time cube. To demonstrate the advantages of our approach, DynNoSlice is compared with state-of-the-art timeslicing methods using a metrics-based experiment. Finally, we present case studies of event-based dynamic data visualised with the new model and algorithm.
published_date	2018-12-18T03:58:08Z
_version_	1763752949100576768
score	11.036334

Event-Based Dynamic Graph Visualisation

Similar Items