Cabinet Tree: an orthogonal enclosure approach to visualizing and exploring big data

Yalong Yang, Kang Zhang, Jianrong Wang*, Quang Vinh Nguyen

*Corresponding author for this work

Research output: Contribution to journalJournal Articlepeer-review

4 Citations (Scopus)

Abstract

Treemaps are well-known for visualizing hierarchical data. Most related approaches have been focused on layout algorithms and paid little attention to other display properties and interactions. Furthermore, the structural information in conventional Treemaps is too implicit for viewers to perceive. This paper presents Cabinet Tree, an approach that: i) draws branches explicitly to show relational structures, ii) adapts a space-optimized layout for leaves and maximizes the space utilization, iii) uses coloring and labeling strategies to clearly reveal patterns and contrast different attributes intuitively. We also apply the continuous node selection and detail window techniques to support user interaction with different levels of the hierarchies. Our quantitative evaluations demonstrate that Cabinet Tree achieves good scalability for increased resolutions and big datasets.

Original languageEnglish
Article number15
JournalJournal of Big Data
Volume2
Issue number1
DOIs
Publication statusPublished - 1 Dec 2015
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2015, Yang et al.

Keywords

  • Big data
  • Hierarchical visualization
  • Orthogonal enclosure
  • Tree drawing

Fingerprint

Dive into the research topics of 'Cabinet Tree: an orthogonal enclosure approach to visualizing and exploring big data'. Together they form a unique fingerprint.

Cite this