2020 Visualization in Data Science (VDS) 2020
DOI: 10.1109/vds51726.2020.00008
|View full text |Cite
|
Sign up to set email alerts
|

dg2pix: Pixel-Based Visual Analysis of Dynamic Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 44 publications
0
4
0
Order By: Relevance
“…Recently, clustering algorithms have become popular in visualizing dense networks to reduce screen space constraints and reveal patterns on large networks. For example, Cakmak et al [24] applied a hierarchical density-based spatial clustering algorithm [25] to reduce VC in visualizing long sequences of dynamic graphs. The clustering algorithm grouped and arranged similar features in pixel-based visualizations to reveal the temporal patterns.…”
Section: Related Workmentioning
confidence: 99%
“…Recently, clustering algorithms have become popular in visualizing dense networks to reduce screen space constraints and reveal patterns on large networks. For example, Cakmak et al [24] applied a hierarchical density-based spatial clustering algorithm [25] to reduce VC in visualizing long sequences of dynamic graphs. The clustering algorithm grouped and arranged similar features in pixel-based visualizations to reveal the temporal patterns.…”
Section: Related Workmentioning
confidence: 99%
“…Particularly, its backend model first extracts node embeddings of different timestamps and then applies embedding alignment, which shows strong capability in capturing local information, i.e., the similarity among players. Eren et al [11] displayed the similarity and difference of temporally dynamic graphs by sorting the graph embedding vectors. Our approach is different from the above works on two dimensions.…”
Section: Graph Latent Representationsmentioning
confidence: 99%
“…All evaluations are primarily usage scenarios. For instance, dg2pix [42] provides an overview of large dynamic graphs using a dense pixelbased visualization to explore graph embeddings at multiple temporal scales. A notable paper is Pálenik et al [43] that proposes a pixelmap to analyze spatio-temporal particle simulations at multiple temporal and spatial scales.…”
Section: Graph and Tree (8/36)mentioning
confidence: 99%