RoClust: Role discovery for graph clustering
Abstract
Graph clustering, or community detection, is an important task of discovering the underlying structure in a network by clustering vertices in a graph into communities. In the past decades, non-overlapping methods such as normalized cuts and modularity-based methods, which assume that each vertex belongs to a single community, are proposed to discover disjoint communities. On the other hand, overlapping methods such as CPM, which assume that each vertex can belong to multiple communities, have been drawing increasing attention as the assumption fits the reality. In this paper, we show that existing non-overlapping and overlapping methods lack consideration to edges that link a vertex to its neighbors belonging to different communities, which often leads to counter-intuitive results of vertices located near borders of communities. Therefore, we propose a new graph clustering methods named RoClust, which uses three roles, bridges, gateways and hubs to discover communities. Each of the three roles represents a kind of vertices that connect communities. Experimental results show that RoClust outperforms state-of-the-art methods of graph clustering including non-overlapping and overlapping methods.
References
[1]
Y.-Y. Ahn, J.P. Bagrow and S. Lehmann, Link communities reveal multiscale complexity in networks, Nature 466(7307) (2010), 761-764.
[2]
J.A. Almendral, I. Leyva, D. Li, I. Sendiña-Nadal, S. Havlin and S. Boccaletti, Dynamics of overlapping structures in modular networks, Physics Review E 82(1) (2010), 016115.
[3]
J. Baumes, M.K. Goldberg, M.S. Krishnamoorthy, M. Magdon-Ismail and N. Preston, Finding communities by clustering a graph into overlapping subgraphs, in: Proc. of the IADIS International Conference on Applied Computing (IADIS AC), IADIS, 2005, pp. 97-104.
[4]
V.D. Blondel, J.-L. Guillaume, R. Lambiotte and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment 2008(10) (2008), P10008.
[5]
U. Brandes, D. Delling, M. Gaertler, M. Hoefer, Z. Nikoloski and D. Wagner, On finding graph clusterings with maximum modularity, in: Graph-Theoretic Concepts in Computer Science (WG), A. Brandstädt, D. Kratsch and H. Müller, eds, LNCS, Vol. 4769, Springer-Verlag, Berlin, 2007, pp. 121-132.
[6]
C. Bron and J. Kerbosch, Algorithm 457: Finding all cliques of an undirected graph, Communications of the ACM 16(9) (1973), 575-577.
[7]
D. Chakrabarti, AutoPart: Parameter-free graph partitioning and outlier detection, in: Knowledge Discovery in Databases: PKDD 2004, J.-F. Boulicaut, F. Esposito, F. Giannotti and D. Pedreschi, eds, LNAI, Vol. 3202, Springer-Verlag, 2004, pp. 112-124.
[8]
D. Chakrabarti, S. Papadimitriou, D.S. Modha and C. Faloutsos, Fully automatic cross-associations, in: Proc. of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), ACM, New York, NY, 2004, pp. 79-88.
[9]
W.K. Cheung and Y. Sun, Identifying a hierarchy of bipartite subgraphs for web site abstraction, Web Intelligence and Agent Systems, IOS Press 5(3) (2007), 343-355.
[10]
B.-H. Chou and E. Suzuki, Discovering community-oriented roles of nodes in a social network, in: Data Warehousing and Knowledge Discovery (DaWaK), T.B. Pedersen, M.K. Mohania, A.M. Tjoa, eds, LNCS, Vol. 6263, Springer-Verlag, 2010, pp. 52-64.
[11]
B.-H. Chou and E. Suzuki, Role discovery for graph clustering, in: Web Technologies and Applications (APWeb), X. Du, W. Fan, j. Wang, Z. Peng and M.A. Sharaf, eds, LNCS, Vol. 6612, Springer-Verlag, 2011, pp. 17-28.
[12]
A. Clauset, M.E.J. Newman and C. Moore, Finding community structure in very large networks, Physics Review E 70(6) (2004), 066111.
[13]
A. Clauset, Finding local community structure in networks, Physics Review E 72(2) (2005), 026132.
[14]
I. Dhillon, Y. Guan and B. Kulis, Weighted graph cuts without eigenvectors: A multilevel approach, IEEE Transactions on Pattern Analysis and Machine Intelligence 29(11) (2007), 1944-1957.
[15]
T.S. Evans and R. Lambiotte, Line graphs, link partitions, and overlapping communities, Physics Review E 80(1) (2009), 016105.
[16]
S. Fortunato, Community detection in graphs, Physics Reports 486(3-5) (2010), 75-174.
[17]
M. Girvan and M.E.J. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences of the United States of America (PNAS) 99(12) (2002), 7821-7826.
[18]
S. Gregory, An algorithm to find overlapping community structure in networks, in: Knowledge Discovery in Databases: PKDD 2007, J.N. Kok, J. Koronacki, R. Lopez de Mantaras, S. Matwin and D. Mladenic, eds, LNAI, Vol. 4702, Spinger-Verlag, 2007, pp. 91-102.
[19]
S. Gregory, A fast algorithm to find overlapping communities in networks, in: Machine Learning and Knowledge Discovery in Databases (ECML/PKDD), W. Daelemans and K. Morik, eds, LNAI, Vol. 5211, Springer-Verlag, 2008, pp. 408-423.
[20]
S. Gregory, Finding overlapping communities in networks by label propagation, New Journal of Physics 12(10) (2010), 103018.
[21]
R. Guimerà, M. Sales-Pardo and L.A.N. Amaral, Modularity from fluctuations in random graphs and complex networks, Physics Review E 70(2) (2004), 025101.
[22]
R. Guimerà and L.A.N. Amaral, Functional cartography of complex metabolic networks, Nature 433(7028) (2005), 895- 900.
[23]
L.W. Hagen and A.B. Kahng, New spectral methods for ratio cut partitioning and clustering, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 11(9) (1992), 1074-1085.
[24]
H. Hirai, B.-H. Chou and E. Suzuki, A parameter-free method for discovering generalized clusters in a network, in: Discovery Science (DS), T. Elomaa, J. Hollmén and H. Mannila, eds, LNAI, Vol. 6926, Springer-Verlag, Berlin, 2011, pp. 135-149.
[25]
A. Jatowt and M. Ishizuka, Temporal multi-page summarization, Web Intelligence and Agent Systems, IOS Press 4(2) (2006), 163-180.
[26]
D.E. Knuth, The Stanford Graphbase: A Platform For Combinatorial Computing, Addison-Wesley, Reading, MA, 1993.
[27]
A. Lancichinetti, S. Fortunato and J. Kertész, Detecting the overlapping and hierarchical community structure of complex networks, New Journal of Physics 11(3) (2009), 033015.
[28]
A. Lancichinetti and S. Fortunato, Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities, Physics Review E 80(1) (2009), 016118.
[29]
J. Leskovec, K.J. Lang, A. Dasgupta and M.W. Mahoney, Statistical properties of community structure in large social and information networks, in: Proc. of the 17th International Conference on World Wide Web (WWW), ACM, 2008, pp. 695-704.
[30]
I.X.Y. Leung, P. Hui, P. Liò and J. Crowcroft, Towards real-time community detection in large networks, Physics Review E 79(6) (2009), 066107.
[31]
P. Lingras, M. Hogo and M. Snorek, Interval set clustering of web users using modified Kohonen self-organizing maps based on the properties of rough sets, Web Intelligence and Agent Systems, IOS Press 2(4) (2004), 217-230.
[32]
F. Luo, J.Z. Wang and E. Promislow, Exploring local community structures in large networks, Web Intelligence and Agent Systems, IOS Press 6(4) (2008), 387-400.
[33]
D. Lusseau, K. Schneider, O.J. Boisseau, P. Haase, E. Slooten and S.M. Dawson, The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations, Behavioral Ecology and Sociobiology 54(4) (2003), 396-405.
[34]
D. Nelson, C. McEvoy and T. Schreiber, The university of South Florida word association, rhyme, and word fragment norms, http://w3.usf.edu/FreeAssociation/, 1998.
[35]
M.E.J. Newman and M. Girvan, Finding and evaluating community structure in networks, Physics Review E 69(2) (2004), 026113.
[36]
M.E.J. Newman, Fast algorithm for detecting community structure in networks, Physics Review E 69(6) (2004), 066133.
[37]
M.E.J. Newman, Modularity and community structure in networks, Proceedings of the National Academy of Sciences of the United States of America (PNAS) 103(23) (2006), 8577- 8582.
[38]
M.E.J. Newman, Finding community structure in networks using the eigenvectors of matrices, Physics Review E 74(3) (2006), 036104.
[39]
V. Nicosia, G. Mangioni, V. Carchiolo and M. Malgeri, Extending the definition of modularity to directed graphs with overlapping communities, Journal of Statistical Mechanics: Theory and Experiment 2009(3) (2009), P03024.
[40]
G. Palla, I. Derényi, I. Farkas and T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society, Nature 435(7043) (2005), 814-818.
[41]
P. Pons and M. Latapy, Computing communities in large networks using random walks, Journal of Graph Algorithms and Applications 10(2) (2006), 191-218.
[42]
U.N. Raghavan, R. Albert and S. Kumara, Near linear time algorithm to detect community structures in large-scale networks, Physics Review E 76(3) (2007), 036106.
[43]
P.K. Reddy, M. Kitsuregawa, P. Sreekanth and S.S. Rao, A graph based approach to extract a neighborhood customer community for collaborative filtering, in: Databases in Networked Information Systems (DNIS), S. Bhalla, ed., LNCS, Vol. 2544, Springer-Verlag, 2002, pp. 188-200.
[44]
S.E. Schaeffer, Graph clustering, Computer Science Review 1(1) (2007), 27-64.
[45]
H. Shen, X. Cheng, K. Cai and M.-B. Hu, Detect overlapping and hierarchical community structure in networks, Physica A: Statistical Mechanics and its Applications 388(8) (2009), 1706-1712.
[46]
J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8) (2000), 888-905.
[47]
L. ¿ubelj and M. Bajec, Unfolding communities in large complex networks: combining defensive and offensive label propagation for core extraction, Physics Review E 83(3) (2011), 036103.
[48]
J. Sun, C. Faloutsos, S. Papadimitriou and P.S. Yu, Graph-Scope: parameter-free mining of large time-evolving graphs, in: Proc. of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), ACM, New York, NY, 2007, pp. 687-696.
[49]
S. van Dongen, Graph clustering by flow simulation, PhD Thesis, University of Utrecht, 2000.
[50]
D.J. Watts and S.H. Strogatz, Collective dynamics of "small-world" networks, Nature 393(6684) (1998), 440-442.
[51]
X. Xu, N. Yuruk, Z. Feng and T. Schweiger, SCAN: A structural clustering algorithm for networks, in: Proc. of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), ACM, New York, NY, 2007, pp. 824-833.
[52]
S. Zhang, R. Wang and X. Zhang, Identification of overlapping community structure in complex networks using fuzzy c-means clustering, Physica A: Statistical Mechanics and its Applications 374(1) (2007), 483-490.
[53]
J. Zhu, A. Goncalves, V. Uren, E. Motta, R. Pacheco, M. Eisenstadt and D. Song, Relation discovery from web data for competency management, Web Intelligence and Agent Systems, IOS Press 5(4) (2007), 405-417.
Index Terms
- RoClust: Role discovery for graph clustering
Index terms have been assigned to the content through auto-classification.
Recommendations
Top-k overlapping densest subgraphs
Finding dense subgraphs is an important problem in graph mining and has many practical applications. At the same time, while large real-world networks are known to have many communities that are not well-separated, the majority of the existing work ...
Community-Affiliation Graph Model for Overlapping Network Community Detection
ICDM '12: Proceedings of the 2012 IEEE 12th International Conference on Data MiningOne of the main organizing principles in real-world networks is that of network communities, where sets of nodes organize into densely linked clusters. Communities in networks often overlap as nodes can belong to multiple communities at once. ...
Community detection and visualization in social networks: Integrating structural and semantic information
Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web MiningDue to the explosion of social networking and the information sharing among their users, the interest in analyzing social networks has increased over the recent years. Two general interests in this kind of studies are community detection and ...
Comments
Information & Contributors
Information
Published In
Publisher
IOS Press
Netherlands
Publication History
Published: 01 January 2013
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in