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. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1186/s40537-015-0022-3 | J. Big Data |
Keywords | Field | DocType |
Orthogonal enclosure, Tree drawing, Hierarchical visualization, Big data | Data science,Computational Science and Engineering,Data mining,Cabinet (file format),Enclosure,Quantitative Evaluations,Computer science,Theoretical computer science,Hierarchy,Hierarchical database model,Big data,Scalability | Journal |
Volume | Issue | ISSN |
2 | 1 | 2196-1115 |
Citations | PageRank | References |
2 | 0.38 | 27 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yalong Yang | 1 | 54 | 7.55 |
Kang Zhang | 2 | 1054 | 126.26 |
Jianrong Wang | 3 | 17 | 5.69 |
Quang Vinh Nguyen | 4 | 232 | 32.97 |