Abstract
With the rapid increasing size of the network, mining and analyzing the network structure characteristics to enhance network awareness and understanding are facing severe challenges. We use community detection algorithm to obtain the community division. The network nodes are layout by force directed methods to visualize the network structure. At the same time magnifying metaphor method is used to enhance interactively inquiring details to achieve focus-context display. Experimental results show that this can help the network understanding and situation awareness.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 66111 (2004)
Eades, P.: A heuristic for graph drawing (1984)
Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31(1), 7–15 (1989)
Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pr. Exp. 21, 1129–1164 (1991)
Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graph. 15, 301–331 (1996)
Hachul, S., Jünger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285–295. Springer, Heidelberg (2005)
Barnes, J., Hut, P.: A hierarchical O(N log N) force-calculation algorithm. Nature 324, 446–449 (1986)
The Barnes-Hut Algorithm: http://arborjs.org/docs/barnes-hut
Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 211–221. Springer, Heidelberg (2001)
Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 183–196. Springer, Heidelberg (2001)
Quigley, A., Eades, P.: FADE: graph drawing, clustering, and visual abstraction. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 197–210. Springer, Heidelberg (2001)
Tunkelang, D.: JIGGLE: java interactive graph layout environment. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 413–422. Springer, Heidelberg (1999)
Walshaw, C.: A multilevel algorithm for force-directed graph drawing. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 171–182. Springer, Heidelberg (2001)
Card, S.K., Mackinlay, J.D., Shneiderman, B. (eds.): Readings in Information Visualization: Using Vision to Think. Morgan Kaufmann Publishers Inc., San Francisco (1999)
Sarkar, M., Brown, M.H.: Graphical fisheye views of graphs. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 83–91
Tory, M., Moller, T.: Human factors in visualization research. IEEE Trans. Vis. Comput. Graph. 10, 72–84 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Zhonghua, Y., Lingda, W. (2016). Network Visual Analysis Based on Community Detection. In: Luo, Y. (eds) Cooperative Design, Visualization, and Engineering. CDVE 2016. Lecture Notes in Computer Science(), vol 9929. Springer, Cham. https://doi.org/10.1007/978-3-319-46771-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-46771-9_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46770-2
Online ISBN: 978-3-319-46771-9
eBook Packages: Computer ScienceComputer Science (R0)