Importance-driven visualization layouts for large time series data

M. Hao, U. Dayal, D. Keim, T. Schreck
{"title":"Importance-driven visualization layouts for large time series data","authors":"M. Hao, U. Dayal, D. Keim, T. Schreck","doi":"10.1109/INFVIS.2005.1532148","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":123643,"journal":{"name":"IEEE Symposium on Information Visualization, 2005. INFOVIS 2005.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"65","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Symposium on Information Visualization, 2005. INFOVIS 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFVIS.2005.1532148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 65

Abstract

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.
大型时间序列数据的重要性驱动可视化布局
时间序列是一种重要的数据类型,在现实世界的几乎每个方面都有应用。通常需要并行地监视和分析大量的时间序列。时间序列集可能表现出内在的层次关系和各个时间序列之间不同程度的重要性。可视化分析大量时间序列的有效技术应该根据大小和位置对时间序列数据的相对重要性和层次顺序进行编码,并且还应该提供高度的规律性,以支持分析人员的可比性。在本文中,我们提出了一个可视化大时间序列集的框架。基于时间序列间重要性关系的概念,定义了一组时间序列数据填充布局方案应遵循的目标函数。我们开发了一种有效的算法,通过生成在具有有利宽高比的规则布局中反映层次和基于重要性的关系的布局来解决已识别的问题。我们将我们的技术应用于许多现实世界的数据集,包括销售和库存数据,并将我们的技术与众所周知的TreeMap算法的宽高比感知变体进行比较。实例显示了该布局算法的优点和实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书