Visual Clustering of Complex Network Based on Nonlinear Dimension Reduction
In this paper, we present a new visual clustering algorithm inspired by nonlinear dimension reduction technique: Isomap. The algorithm firstly defines a new graph distance between any two nodes in complex networks and then applies the distance matrix to Isomap and projects all nodes into a two dimensional plane, The experiments prove that the projected nodes emerge clear clustering property which is hidden in original complex networks and the distances between any two nodes reflect their close or distant relationships.
Key wordscomplex network visual clustering Isomap graph distance
- 7.T.F. Cox, M.A.A. Cox.: Multidimensional Scaling. Chapman & Hall, (2000).Google Scholar
- 10.Auber, D., Chiricota, Y., Jourdan, F., and Melancon, G.: Multiscale visualization of small world networks. In Proceedings of the 2003 IEEE Symposium on Information Visualization (2003) 75–81.Google Scholar