Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

10-2019

Abstract

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 timeslices 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 nonuni-form 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.

Keywords

Human-centered computing, Visualization, Visualization techniques, Graph Visualization

Discipline

Graphics and Human Computer Interfaces | Software Engineering

Research Areas

Software and Cyber-Physical Systems

Publication

Proceedings of the 30th IEEE Visualization Conference, IEEE VIS 2019, Vancouver, Canada, October 20-25

First Page

1

Last Page

5

ISBN

9781728149417

Identifier

10.1109/VISUAL.2019.8933748

Publisher

IEEE

City or Country

New York

Additional URL

https://doi.org/10.1109/VISUAL.2019.8933748

Download

Share

COinS