Visual summaries for graph collections

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Graphs can be used to represent a variety of information, from molecular structures to biological pathways to computational workflows. With a growing volume of data represented as graphs, the problem of understanding and analyzing the variations in a collection of graphs is of increasing importance. We present an algorithm to compute a single summary graph that efficiently encodes an entire collection of graphs by finding and merging similar nodes and edges. Instead of only merging nodes and edges that are exactly the same, we use domain-specific comparison functions to collapse similar nodes and edges which allows us to generate more compact representations of the collection. In addition, we have developed methods that allow users to interactively control the display of these summary graphs. These interactions include the ability to highlight individual graphs in the summary, control the succinctness of the summary, and explicitly define when specific nodes should or should not be merged. We show that our approach to generating and interacting with graph summaries leads to a better understanding of a graph collection by allowing users to more easily identify common substructures and key differences between graphs.

Original languageEnglish (US)
Title of host publicationIEEE Symposium on Pacific Visualization 2013, PacificVis 2013 - Proceedings
Pages57-64
Number of pages8
DOIs
StatePublished - 2013
Event6th IEEE Symposium on Pacific Visualization, PacificVis 2013 - Sydney, NSW, Australia
Duration: Feb 26 2013Mar 1 2013

Other

Other6th IEEE Symposium on Pacific Visualization, PacificVis 2013
CountryAustralia
CitySydney, NSW
Period2/26/133/1/13

Fingerprint

Merging
Molecular structure
Display devices

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Software

Cite this

Koop, D., Freire, J., & Silva, C. (2013). Visual summaries for graph collections. In IEEE Symposium on Pacific Visualization 2013, PacificVis 2013 - Proceedings (pp. 57-64). [6596128] https://doi.org/10.1109/PacificVis.2013.6596128

Visual summaries for graph collections. / Koop, David; Freire, Juliana; Silva, Claudio.

IEEE Symposium on Pacific Visualization 2013, PacificVis 2013 - Proceedings. 2013. p. 57-64 6596128.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Koop, D, Freire, J & Silva, C 2013, Visual summaries for graph collections. in IEEE Symposium on Pacific Visualization 2013, PacificVis 2013 - Proceedings., 6596128, pp. 57-64, 6th IEEE Symposium on Pacific Visualization, PacificVis 2013, Sydney, NSW, Australia, 2/26/13. https://doi.org/10.1109/PacificVis.2013.6596128
Koop D, Freire J, Silva C. Visual summaries for graph collections. In IEEE Symposium on Pacific Visualization 2013, PacificVis 2013 - Proceedings. 2013. p. 57-64. 6596128 https://doi.org/10.1109/PacificVis.2013.6596128
Koop, David ; Freire, Juliana ; Silva, Claudio. / Visual summaries for graph collections. IEEE Symposium on Pacific Visualization 2013, PacificVis 2013 - Proceedings. 2013. pp. 57-64
@inproceedings{3a3740517e1f4fcd9b01383c9d046b38,
title = "Visual summaries for graph collections",
abstract = "Graphs can be used to represent a variety of information, from molecular structures to biological pathways to computational workflows. With a growing volume of data represented as graphs, the problem of understanding and analyzing the variations in a collection of graphs is of increasing importance. We present an algorithm to compute a single summary graph that efficiently encodes an entire collection of graphs by finding and merging similar nodes and edges. Instead of only merging nodes and edges that are exactly the same, we use domain-specific comparison functions to collapse similar nodes and edges which allows us to generate more compact representations of the collection. In addition, we have developed methods that allow users to interactively control the display of these summary graphs. These interactions include the ability to highlight individual graphs in the summary, control the succinctness of the summary, and explicitly define when specific nodes should or should not be merged. We show that our approach to generating and interacting with graph summaries leads to a better understanding of a graph collection by allowing users to more easily identify common substructures and key differences between graphs.",
author = "David Koop and Juliana Freire and Claudio Silva",
year = "2013",
doi = "10.1109/PacificVis.2013.6596128",
language = "English (US)",
isbn = "9781467347976",
pages = "57--64",
booktitle = "IEEE Symposium on Pacific Visualization 2013, PacificVis 2013 - Proceedings",

}

TY - GEN

T1 - Visual summaries for graph collections

AU - Koop, David

AU - Freire, Juliana

AU - Silva, Claudio

PY - 2013

Y1 - 2013

N2 - Graphs can be used to represent a variety of information, from molecular structures to biological pathways to computational workflows. With a growing volume of data represented as graphs, the problem of understanding and analyzing the variations in a collection of graphs is of increasing importance. We present an algorithm to compute a single summary graph that efficiently encodes an entire collection of graphs by finding and merging similar nodes and edges. Instead of only merging nodes and edges that are exactly the same, we use domain-specific comparison functions to collapse similar nodes and edges which allows us to generate more compact representations of the collection. In addition, we have developed methods that allow users to interactively control the display of these summary graphs. These interactions include the ability to highlight individual graphs in the summary, control the succinctness of the summary, and explicitly define when specific nodes should or should not be merged. We show that our approach to generating and interacting with graph summaries leads to a better understanding of a graph collection by allowing users to more easily identify common substructures and key differences between graphs.

AB - Graphs can be used to represent a variety of information, from molecular structures to biological pathways to computational workflows. With a growing volume of data represented as graphs, the problem of understanding and analyzing the variations in a collection of graphs is of increasing importance. We present an algorithm to compute a single summary graph that efficiently encodes an entire collection of graphs by finding and merging similar nodes and edges. Instead of only merging nodes and edges that are exactly the same, we use domain-specific comparison functions to collapse similar nodes and edges which allows us to generate more compact representations of the collection. In addition, we have developed methods that allow users to interactively control the display of these summary graphs. These interactions include the ability to highlight individual graphs in the summary, control the succinctness of the summary, and explicitly define when specific nodes should or should not be merged. We show that our approach to generating and interacting with graph summaries leads to a better understanding of a graph collection by allowing users to more easily identify common substructures and key differences between graphs.

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

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

U2 - 10.1109/PacificVis.2013.6596128

DO - 10.1109/PacificVis.2013.6596128

M3 - Conference contribution

AN - SCOPUS:84888988567

SN - 9781467347976

SP - 57

EP - 64

BT - IEEE Symposium on Pacific Visualization 2013, PacificVis 2013 - Proceedings

ER -