Subscribe

Issue No.01 - Jan.-Feb. (2013 vol.33)

pp: 58-68

Xianlin Hu , Univ. of North Carolina at Charlotte, Charlotte, NC, USA

Aidong Lu , Univ. of North Carolina at Charlotte, Charlotte, NC, USA

Xintao Wu , Univ. of North Carolina at Charlotte, Charlotte, NC, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCG.2012.89

ABSTRACT

Network visualization techniques have been widely used to explore social networks, which are crucial to many application domains. A proposed visual-analytics approach provides functions that were previously hard to obtain. Based on recent achievements in spectrum-based analysis, it uses the features of node distribution and coordinates in the high-dimensional spectral space. Specifically, three-stage node projection and dispersion on a k-dimensional sphere in the spectral space determines the network layout. To assist interactive exploration of network topologies, network visualization and interactive analysis let users filter nodes and edges in a way that's meaningful to the global topology structure.

INDEX TERMS

Social network services, Layout, Network topology, Dispersion, Visualization, Topology, Algorithm design and analysis, Data visualization, Visual analytics,spectrum-based analysis, Social network services, Layout, Network topology, Dispersion, Visualization, Topology, Algorithm design and analysis, Data visualization, Visual analytics, visual analytics, Social network services, Layout, Network topology, Dispersion, Visualization, Topology, Algorithm design and analysis, Data visualization, Visual analytics, computer graphics, network visualization, network topology

CITATION

Xianlin Hu, Aidong Lu, Xintao Wu, "Spectrum-Based Network Visualization for Topology Analysis",

*IEEE Computer Graphics and Applications*, vol.33, no. 1, pp. 58-68, Jan.-Feb. 2013, doi:10.1109/MCG.2012.89REFERENCES

- 1. A. Seary and W. Richards, “Spectral Methods for Analyzing and Visualizing Networks: An Introduction,”
Nat'l Research Council, Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers, Nat'l Academies Press, 2003, pp. 209–228.- 2. X. Ying and X. Wu, “On Randomness Measures for Social Networks,”
Proc. 9th SIAM Conf. Data Mining, Soc. for Industrial and Applied Mathematics, 2009, pp. 709–720.- 3. V. Krebs, “New Political Patterns,” 2008; www.orgnet.comdivided.html.
- 4. M.E.J. Newman, “Modularity and Community Structure in Networks,”
Proc. Nat'l Academy of Sciences, vol. 103, no. 23, 2006, pp. 8577–8582.- 5. L.N. Trefethen and D. Bau,
Numerical Linear Algebra, Soc. for Industrial and Applied Mathematics, 1997.- 6. A. Morrison, G. Ross, and M. Chalmers, “Fast Multidimensional Scaling through Sampling, Springs and Interpolation,”
Information Visualization, vol. 2, no. 1, 2003, pp. 68–77.- 7. T.M.J. Fruchterman and E.M. Reingold, “Graph Drawing by Force-Directed Placement,”
Software: Practice and Experience, vol. 21, no. 11, 1991, pp. 1129–1164.- 8. S. Hachul and M. Jünger, “Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm,”
Graph Drawing, LNCS 3383, Springer, 2004, pp. 285–295.- 9. D. Harel and Y. Koren, “Graph Drawing by High-Dimensional Embedding,”
Revised Papers from the 10th Int'l Symp. Graph Drawing (GD 02), Springer, 2002, pp. 207–219.- 10. Y. Koren, L. Carmel, and D. Harel, “Drawing Huge Graphs by Algebraic Multigrid Optimization,”
Multiscale Modeling and Simulation, vol. 1, no. 4, 2003, pp. 645–673.- 11. P. Sen et al., “Collective Classification in Network Data,”
AI Magazine, vol. 29, no. 3, 2008, pp. 93–106. |