Difference map readability for dynamic graphs

Daniel Archambault; Helen C. Purchase; Bruno Pinaud

doi:10.1007/978-3-642-18469-7_5

Difference map readability for dynamic graphs

Daniel Archambault, Helen C. Purchase, Bruno Pinaud

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

31 Citations (Scopus)

Abstract

Difference maps are one way to show changes between timeslices in a dynamic graph. They highlight, using colour, the nodes and edges that were added, removed, or persisted between every pair of adjacent timeslices. Although some work has used difference maps for visualization, no user study has been performed to gauge their performance. In this paper, we present a user study to evaluate the effectiveness of difference maps in comparison with presenting the evolution of the dynamic graph over time on three interfaces. We found evidence that difference maps produced significantly fewer errors when determining the number of edges inserted or removed from a graph as it evolves over time. Also, difference maps were significantly preferred on all tasks.

Original language	English
Title of host publication	Graph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers
Publisher	Springer
Pages	50-61
Number of pages	12
ISBN (Print)	9783642184680
DOIs	https://doi.org/10.1007/978-3-642-18469-7_5
Publication status	Published - 2011
Externally published	Yes
Event	Graph Drawing 2010 - Konstanz, Germany Duration: 21 Sept 2010 → 24 Sept 2010 Conference number: 18th https://link.springer.com/book/10.1007/978-3-642-18469-7 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6502 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Graph Drawing 2010
Abbreviated title	GD 2010
Country/Territory	Germany
City	Konstanz
Period	21/09/10 → 24/09/10
Internet address	https://link.springer.com/book/10.1007/978-3-642-18469-7 (Proceedings)

Access to Document

10.1007/978-3-642-18469-7_5

Cite this

Archambault, D., Purchase, H. C., & Pinaud, B. (2011). Difference map readability for dynamic graphs. In Graph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers (pp. 50-61). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6502 LNCS). Springer. https://doi.org/10.1007/978-3-642-18469-7_5

@inproceedings{82b08558a12f4069b684cc7971722fe8,

title = "Difference map readability for dynamic graphs",

abstract = "Difference maps are one way to show changes between timeslices in a dynamic graph. They highlight, using colour, the nodes and edges that were added, removed, or persisted between every pair of adjacent timeslices. Although some work has used difference maps for visualization, no user study has been performed to gauge their performance. In this paper, we present a user study to evaluate the effectiveness of difference maps in comparison with presenting the evolution of the dynamic graph over time on three interfaces. We found evidence that difference maps produced significantly fewer errors when determining the number of edges inserted or removed from a graph as it evolves over time. Also, difference maps were significantly preferred on all tasks.",

author = "Daniel Archambault and Purchase, {Helen C.} and Bruno Pinaud",

year = "2011",

doi = "10.1007/978-3-642-18469-7_5",

language = "English",

isbn = "9783642184680",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "50--61",

booktitle = "Graph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers",

note = "Graph Drawing 2010, GD 2010 ; Conference date: 21-09-2010 Through 24-09-2010",

url = "https://link.springer.com/book/10.1007/978-3-642-18469-7",

}

Archambault, D, Purchase, HC & Pinaud, B 2011, Difference map readability for dynamic graphs. in Graph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6502 LNCS, Springer, pp. 50-61, Graph Drawing 2010, Konstanz, Baden-Württemberg, Germany, 21/09/10. https://doi.org/10.1007/978-3-642-18469-7_5

Difference map readability for dynamic graphs. / Archambault, Daniel; Purchase, Helen C.; Pinaud, Bruno.
Graph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers. Springer, 2011. p. 50-61 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6502 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Difference map readability for dynamic graphs

AU - Archambault, Daniel

AU - Purchase, Helen C.

AU - Pinaud, Bruno

N1 - Conference code: 18th

PY - 2011

Y1 - 2011

N2 - Difference maps are one way to show changes between timeslices in a dynamic graph. They highlight, using colour, the nodes and edges that were added, removed, or persisted between every pair of adjacent timeslices. Although some work has used difference maps for visualization, no user study has been performed to gauge their performance. In this paper, we present a user study to evaluate the effectiveness of difference maps in comparison with presenting the evolution of the dynamic graph over time on three interfaces. We found evidence that difference maps produced significantly fewer errors when determining the number of edges inserted or removed from a graph as it evolves over time. Also, difference maps were significantly preferred on all tasks.

AB - Difference maps are one way to show changes between timeslices in a dynamic graph. They highlight, using colour, the nodes and edges that were added, removed, or persisted between every pair of adjacent timeslices. Although some work has used difference maps for visualization, no user study has been performed to gauge their performance. In this paper, we present a user study to evaluate the effectiveness of difference maps in comparison with presenting the evolution of the dynamic graph over time on three interfaces. We found evidence that difference maps produced significantly fewer errors when determining the number of edges inserted or removed from a graph as it evolves over time. Also, difference maps were significantly preferred on all tasks.

UR - http://www.scopus.com/inward/record.url?scp=79952261554&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-18469-7_5

DO - 10.1007/978-3-642-18469-7_5

M3 - Conference Paper

AN - SCOPUS:79952261554

SN - 9783642184680

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 50

EP - 61

BT - Graph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers

PB - Springer

T2 - Graph Drawing 2010

Y2 - 21 September 2010 through 24 September 2010

ER -

Difference map readability for dynamic graphs

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this