Nonuniform timeslicing of dynamic graphs based on visual complexity
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 mi...
Saved in:
Main Authors: | , , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2019
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/5376 https://ink.library.smu.edu.sg/context/sis_research/article/6380/viewcontent/nonuniform__PV.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-6380 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-63802020-12-02T04:44:10Z Nonuniform timeslicing of dynamic graphs based on visual complexity WANG, Yong ARCHAMBAULT, Daniel HALEEM, Hammad MOELLER, Torsten WU, Yanhong QU, Huamin 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. 2019-10-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/5376 info:doi/10.1109/VISUAL.2019.8933748 https://ink.library.smu.edu.sg/context/sis_research/article/6380/viewcontent/nonuniform__PV.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Human-centered computing Visualization Visualization techniques Graph Visualization Graphics and Human Computer Interfaces Software Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Human-centered computing Visualization Visualization techniques Graph Visualization Graphics and Human Computer Interfaces Software Engineering |
spellingShingle |
Human-centered computing Visualization Visualization techniques Graph Visualization Graphics and Human Computer Interfaces Software Engineering WANG, Yong ARCHAMBAULT, Daniel HALEEM, Hammad MOELLER, Torsten WU, Yanhong QU, Huamin Nonuniform timeslicing of dynamic graphs based on visual complexity |
description |
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. |
format |
text |
author |
WANG, Yong ARCHAMBAULT, Daniel HALEEM, Hammad MOELLER, Torsten WU, Yanhong QU, Huamin |
author_facet |
WANG, Yong ARCHAMBAULT, Daniel HALEEM, Hammad MOELLER, Torsten WU, Yanhong QU, Huamin |
author_sort |
WANG, Yong |
title |
Nonuniform timeslicing of dynamic graphs based on visual complexity |
title_short |
Nonuniform timeslicing of dynamic graphs based on visual complexity |
title_full |
Nonuniform timeslicing of dynamic graphs based on visual complexity |
title_fullStr |
Nonuniform timeslicing of dynamic graphs based on visual complexity |
title_full_unstemmed |
Nonuniform timeslicing of dynamic graphs based on visual complexity |
title_sort |
nonuniform timeslicing of dynamic graphs based on visual complexity |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2019 |
url |
https://ink.library.smu.edu.sg/sis_research/5376 https://ink.library.smu.edu.sg/context/sis_research/article/6380/viewcontent/nonuniform__PV.pdf |
_version_ |
1770575437160775680 |