Nonuniform Timeslicing of Dynamic Graphs Based on Visual Complexity
Nonuniform Timeslicing of Dynamic Graphs Based on Visual Complexity
复制标题
DOI：
10.1109/visual.2019.8933748
复制
发表时间：
2019-07
期刊：
影响因子：
--
通讯作者：
Yong Wang;D. Archambault;Hammad Haleem;Torsten Möller;Yanhong Wu;Huamin Qu
中科院分区：
文献类型：
--
作者：
Yong Wang;D. Archambault;Hammad Haleem;Torsten Möller;Yanhong Wu;Huamin Qu
动态图的均匀时间切片由于其在时间维度上的方便性和均匀性而被使用。然而，均匀时间切片不考虑数据集，这可能会产生具有边缘突发的混乱时间片和具有很少交互的空时间片。图挖掘领域已经探索了专门设计用于为挖掘任务保留图特征的非均匀时间切片方法。在本文中，我们提出了一种非均匀时间切片的动态图形可视化方法。我们的目标是创建具有相同视觉复杂度的时间片。为此，我们采用直方图均衡化来创建具有类似事件数量的时间片，平衡时间片的视觉复杂性，并通过突发边缘传达时间片的更重要细节。一个案例研究已经进行了比较，与均匀的时间片，证明我们的方法的有效性。
Uniform timeslicing of dynamic graphs has been used due to its convenience and uniformity across the time dimension. However, uniform timeslicing does not take the data set into account, which can generate cluttered timeslices with edge bursts and empty times-lices with few interactions. The graph mining filed has explored nonuniform timeslicing methods specifically designed to preserve graph features for mining tasks. In this paper, we propose a nonuniform timeslicing approach for dynamic graph visualization. Our goal is to create timeslices of equal visual complexity. To this end, we adapt histogram equalization to create timeslices with a similar number of events, balancing the visual complexity across timeslices and conveying more important details of timeslices with bursting edges. A case study has been conducted, in comparison with uniform timeslicing, to demonstrate the effectiveness of our approach.