Abstract
Graph clustering is an important task of discovering the underlying structure in a network. Well-known methods such as the normalized cut and modularity-based methods are developed in the past decades. These methods may be called non-overlapping because they assume that a vertex belongs to one community. On the other hand, overlapping methods such as CPM, which assume that a vertex may belong to more than one community, have been drawing attention as the assumption fits the reality. We believe that existing overlapping methods are overly simple for a vertex located at the border of a community. That is, they lack careful consideration on the edges that link the vertex to its neighbors belonging to different communities. Thus, we propose a new graph clustering method, named RoClust, which uses three different kinds of roles, each of which represents a different kind of vertices that connect communities. Experimental results show that our method outperforms state-of-the-art methods of graph clustering.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chou, B.-H., Suzuki, E.: Discovering community-oriented roles of nodes in a social network. In: Bach Pedersen, T., Mohania, M.K., Tjoa, A.M. (eds.) DAWAK 2010. LNCS, vol. 6263, pp. 52–64. Springer, Heidelberg (2010)
Clauset, A., Newman, M.E.J., Moore, C.: Finding Community Structure in Very Large Networks. Phys. Rev. E 70(066111), 1–6 (2004)
Dhillon, I., Guan, Y., Kulis, B.: Weighted Graph Cuts without Eigenvectors A Multilevel Approach. IEEE Trans. PAMI 29(11), 1944–1957 (2007)
Evans, T.S., Lambiotte, R.: Line Graphs, Link Partitions, and Overlapping Communities. Phys. Rev. E 80(1) (2009)
Fortunato, S.: Community Detection in Graphs. Phys. Rep. 486, 75–174 (2010)
Girvan, M., Newman, M.E.J.: Community Structure in Social and Biological Networks. PNAS 99(12), 7821–7826 (2002)
Gregory, S.: An Algorithm to Find Overlapping Community Structure in Networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 91–102. Springer, Heidelberg (2007)
Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the Overlapping and Hierarchical Community Structure in Complex Networks. New J. Phys. 11(3) (2009)
Nelson, D., McEvoy, C., Schreiber, T.: USF Word Association (1998), http://w3.usf.edu/FreeAssociation/
Newman, M.E.J.: Fast Algorithm for Detecting Community Structure in Networks. Phys. Rev. E 69(066133) (2004)
Newman, M.E.J.: Modularity and Community Structure in Networks. PNAS 103(23), 8577–8582 (2006)
Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Phys. Rev. E 69(026113) (2004)
Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the Overlapping Community Structure of Complex Networks in Nature and Society. Nature 435(7043), 814–818 (2005)
Schaeffer, S.E.: Graph Clustering. Computer Science Review 1(1), 27–64 (2007)
Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Trans. PAMI 22(8), 888–905 (2000)
Xu, X., Yuruk, N., Feng, Z., Schweiger, T.: SCAN: A Structural Clustering Algorithm for Networks. In: Proc. KDD, pp. 824–833 (2007)
Zhang, S., Wang, R., Zhang, X.: Identification of Overlapping Community Structure in Complex Networks Using Fuzzy c-means Clustering. Physica A 374(1), 483–490 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chou, BH., Suzuki, E. (2011). Role Discovery for Graph Clustering. In: Du, X., Fan, W., Wang, J., Peng, Z., Sharaf, M.A. (eds) Web Technologies and Applications. APWeb 2011. Lecture Notes in Computer Science, vol 6612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20291-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-20291-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20290-2
Online ISBN: 978-3-642-20291-9
eBook Packages: Computer ScienceComputer Science (R0)