A regularized graph layout framework for dynamic network visualization
From MaRDI portal
(Redirected from Publication:468664)
Abstract: Many real-world networks, including social and information networks, are dynamic structures that evolve over time. Such dynamic networks are typically visualized using a sequence of static graph layouts. In addition to providing a visual representation of the network structure at each time step, the sequence should preserve the mental map between layouts of consecutive time steps to allow a human to interpret the temporal evolution of the network. In this paper, we propose a framework for dynamic network visualization in the on-line setting where only present and past graph snapshots are available to create the present layout. The proposed framework creates regularized graph layouts by augmenting the cost function of a static graph layout algorithm with a grouping penalty, which discourages nodes from deviating too far from other nodes belonging to the same group, and a temporal penalty, which discourages large node movements between consecutive time steps. The penalties increase the stability of the layout sequence, thus preserving the mental map. We introduce two dynamic layout algorithms within the proposed framework, namely dynamic multidimensional scaling (DMDS) and dynamic graph Laplacian layout (DGLL). We apply these algorithms on several data sets to illustrate the importance of both grouping and temporal regularization for producing interpretable visualizations of dynamic networks.
Recommendations
- An incremental layout method for visualizing online dynamic graphs
- Clustering, Visualizing, and Navigating for Large Dynamic Graphs
- How Important Is the “Mental Map”? – An Empirical Investigation of a Dynamic Graph Layout Algorithm
- An incremental layout method for visualizing online dynamic graphs
- scientific article; zbMATH DE number 1974104
Cites work
- scientific article; zbMATH DE number 1693557 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3734973 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
- An r-Dimensional Quadratic Placement Algorithm
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An algorithm for drawing general undirected graphs
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Drawing graphs by eigenvectors: theory and practice
- Dynamic Spectral Layout with an Application to Small Worlds
- Empirical Analysis of an Evolving Social Network
- Graph Drawing
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Modern multidimensional scaling. Theory and applications.
- Navigating Clustered Graphs Using Force-Directed Methods
- Nonlinear Dimensionality Reduction
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Supervised multidimensional scaling for visualization, classification, and bipartite ranking
Cited in
(6)- HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs
- Visualizing the effects of a changing distance on data using continuous embeddings
- Time-varying complex network layout algorithm based on node centrality
- Visualisation of structure and processes on temporal networks
- An incremental layout method for visualizing online dynamic graphs
- PLANET: a radial layout algorithm for network visualization
This page was built for publication: A regularized graph layout framework for dynamic network visualization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468664)
