Quantitative Comparison of Time-Dependent Treemaps
share
Rectangular treemaps are often the method of choice for visualizing large hierarchical datasets. Nowadays such datasets are available over time, and hence there is a need for (a) treemapping algorithms that can handle time-dependent data, and (b) corresponding quality criteria and evaluations. In recent years a wide variety of treemapping algorithms and corresponding quality criteria have been proposed, each with their own advantages and limitations, which are often hard to judge and compare. We aim to provide insights to allow researchers and practitioners to make an informed choice when selecting a treemapping algorithm for their specific application and their data. For this, we perform an extensive quantitative evaluation of rectangular treemapping algorithms for time-dependent data. As part of this evaluation we propose a novel classification scheme for time-dependent tree datasets. We approximate the infinite problem space of all such datasets by a low-dimensional feature space spanned by measurable characteristics (features) of the problem instances. We propose four such features to characterize time-dependent hierarchical datasets and classify all datasets used in our experiments accordingly. Moreover, we introduce a new method to measure the stability of time-dependent treemaps which explicitly incorporates the change in the input data. We analyze and visually summarize the results with respect to both visual quality and stability. All datasets, metrics, and algorithms are openly available to facilitate reuse and further comparative studies.
READ FULL TEXT