Exploring multiple trees through DAG representations

Graham, Martin; Kennedy, Jessie

Abstract

We present a Directed Acyclic Graph visualisation designed to allow interaction with a set of multiple classification trees, specifically to find overlaps and differences between groups of trees and individual trees. The work is motivated by the need to find a representation for multiple trees that has the space-saving property of a general graph representation and the intuitive parent-child direction cues present in individual representation of trees. Using example taxonomic data sets, we describe augmentations to the common barycenter DAG layout method that reveal shared sets of child nodes between common parents in a clearer manner. Other interactions such as displaying the multiple ancestor paths of a node when it occurs in several trees, and revealing intersecting sibling sets within the context of a single DAG representation are also discussed.

Citation

Graham, M., & Kennedy, J. (2007). Exploring multiple trees through DAG representations. IEEE Transactions on Visualization and Computer Graphics, 13, 1294-1301. https://doi.org/10.1109/TVCG.2007.70556

• Journal Article Type: Article
• Publication Date: 2007-11
• Deposit Date: Oct 26, 2009
• Publicly Available Date: May 16, 2017
• Print ISSN: 1077-2626
• Publisher: Institute of Electrical and Electronics Engineers
• Peer Reviewed: Peer Reviewed
• Volume: 13
• Pages: 1294-1301
• DOI: https://doi.org/10.1109/TVCG.2007.70556
• Keywords: Computer programming; Program architecture; Multiple trees; Taxonomy; Visualisation; Directed Acyclic Graph.
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3033
• Publisher URL: http://dx.doi.org/10.1109/TVCG.2007.70556