Importance-Driven Visualization Layouts for Large Time Series Data
| Autor: | M.C. Hao, Umeshwar Dayal, Tobias Schreck, Daniel A. Keim |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
Theoretical computer science
Computer science business.industry Efficient algorithm Comparability Time Series Space-Filling Layout Generation ENCODE computer.software_genre Aspect ratio (image) Visualization Information visualization Data visualization Information Visualization Data mining ddc:004 Time series business computer |
| Zdroj: | INFOVIS |
| DOI: | 10.1109/infovis.2005.20 |
| Popis: | Time series are an important type of data with applications in virtually every aspect of the real world. Often a large number of time series have to be monitored and analyzed in parallel. Sets of time series may show intrinsic hierarchical relationships and varying degrees of importance among the individual time series. Effective techniques for visually analyzing large sets of time series should encode the relative importance and hierarchical ordering of the time series data by size and position, and should also provide a high degree of regularity in order to support comparability by the analyst. In this paper, we present a framework for visualizing large sets of time series. Based on the notion of inter time series importance relationships, we define a set of objective functions that space-filling layout schemes for time series data should obey. We develop an efficient algorithm addressing the identified problems by generating layouts that reflect hierarchy and importance based relationships in a regular layout with favorable aspect ratios. We apply our technique to a number of real world data sets including sales and stock data, and we compare our technique with an aspect ratio aware variant of the well known TreeMap algorithm. The examples show the advantages and practical usefulness of our layout algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|