FADE: Graph Drawing, Clustering, and Visual Abstraction
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
INFOVIS '01 Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01)
Streaming-Data Algorithms for High-Quality Clustering
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Graph distances in the streaming model: the value of space
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The CQL continuous query language: semantic foundations and query execution
The VLDB Journal — The International Journal on Very Large Data Bases
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
IEEE Transactions on Visualization and Computer Graphics
GraphScope: parameter-free mining of large time-evolving graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for clustering evolving data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Geometry-Based Edge Clustering for Graph Visualization
IEEE Transactions on Visualization and Computer Graphics
Managing and Mining Graph Data
Managing and Mining Graph Data
GD'06 Proceedings of the 14th international conference on Graph drawing
Visualizing large-scale streaming applications
Information Visualization
Visual analysis of dynamic data streams
Information Visualization
An Application of Edge Bundling Techniques to the Visualization of Media Analysis Results
IV '10 Proceedings of the 2010 14th International Conference Information Visualisation
Multilevel agglomerative edge bundling for visualizing large graphs
PACIFICVIS '11 Proceedings of the 2011 IEEE Pacific Visualization Symposium
Dynamic network visualization in 1.5D
PACIFICVIS '11 Proceedings of the 2011 IEEE Pacific Visualization Symposium
Divided Edge Bundling for Directional Network Data
IEEE Transactions on Visualization and Computer Graphics
GEOMI: GEOmetry for maximum insight
GD'05 Proceedings of the 13th international conference on Graph Drawing
Drawing trees in a streaming model
GD'09 Proceedings of the 17th international conference on Graph Drawing
A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
TGI-EB: a new framework for edge bundling integrating topology, geometry and importance
GD'11 Proceedings of the 19th international conference on Graph Drawing
Winding roads: routing edges into bundles
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Force-directed edge bundling for graph visualization
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
Graph streams have been studied extensively, such as for data mining, while fairly limitedly for visualizations. Recently, edge bundling promises to reduce visual clutter in large graph visualizations, though mainly focusing on static graphs. This paper presents a new framework, namely StreamEB, for edge bundling of graph streams, which integrates temporal, neighbourhood, data-driven and spatial compatibility for edges. Amongst these metrics, temporal and neighbourhood compatibility are introduced for the first time. We then present force-directed and tree-based methods for stream edge bundling. The effectiveness of our framework is then demonstrated using US flights data and Thompson-Reuters stock data.