Abstract
In the era of information explosion, structured data emerge on a large scale. As a description of structured data, network has drawn attention of researchers in many subjects. Network clustering, as an essential part of this study area, focuses on detecting hidden sub-group using structural features of networks. Much previous research covers measuring network structure and discovering clusters. In this paper, a novel structural metric “Graph Distance” and an effective clustering algorithm GRACE are proposed. The graph distance integrates local density of clusters with global structural properties to reflect the actual network structure. The algorithm GRACE generalizes hierarchical and locality clustering methods and outperforms some existing methods. An empirical evaluation demonstrates the performance of our approach on both synthetic data and real world networks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)
Brandes, U.: A Faster Algorithm for Betweenness Centrality. J. Mathematical Sociology 25, 163–177 (2001)
Ding, C., He, X., Zha, H., Gu, M., Simon, H.: A Min-max Cut Algorithm for Graph Partitioning and Data Clustering. In: Proc. of ICDM 2001, pp. 107–114 (2001)
Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density-based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. of 3rd KDD, pp. 226–231. AAAI Press, Menlo Park (1996)
Floyd, R.W.: Algorithm 97 (SHORTEST PATH). Communications of the ACM 5, 345 (1962)
Freeman, L.C.: A Set of Measures of Centrality based upon Betweeness. Sociometry 40, 35–41 (1977)
Girvan, M., Newman, M.E.J.: Community Structure in Social and Biological Networks. PNAS 99, 7821–7826 (2002)
Guimera, R., Amaral, L.A.N.: Functional Cartography of Complex Metabolic Networks. Nature 433, 895–900 (2005)
Hinneburg, A., Keim, D.A.: An Efficient Approach to Clustering in Large Multimedia Databases with Noise. In: Proc. KDD 1998, pp. 58–65 (1998)
Hubert, L., Arabie, P.: Comparing Partitions. J. Classification. 2, 193–218 (1985)
Hwang, W., Kim, T., Ramanathan, M., Zhang, A.: Bridging Centrality: Graph Mining from Element Level to Group Level. In: Proc. of SIGKDD 2008, pp. 336–344. ACM Press, New York (2008)
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In: Proc. of 11th ACM SIGKDD, pp. 177–187. ACM Press, New York (2005)
Network data, http://www-personal.umich.edu/~mejn/netdata
Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Phys. Rev. E 69, 26113 (2004)
Social Network Analysis Software and Services for Organizations, Communities, and their Consultants, http://www.orgnet.com
Wasserman, S., Faust, K.: Social Network Analysis. Cambridge Univ. Press, Cambridge (1994)
Watts, D.J., Strogatz, S.H.: Collective Dynamics of ‘Small World’ Networks. Nature 393, 440–442 (1998)
Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: SCAN: a Structural Clustering Algorithm for Networks. In: Proc. of SIGKDD 2007, pp. 824–833. ACM Press, New York (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Su, X., Li, C. (2009). A Graph Distance Based Structural Clustering Approach for Networks. In: Nicholson, A., Li, X. (eds) AI 2009: Advances in Artificial Intelligence. AI 2009. Lecture Notes in Computer Science(), vol 5866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10439-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-10439-8_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10438-1
Online ISBN: 978-3-642-10439-8
eBook Packages: Computer ScienceComputer Science (R0)