Discovering overlapping community structure in networks through co-clustering

This paper presents a co-clustering based approach to discover overlapping community structure in networks that can be modeled by an undirected unweighted bipartite graph. The co-clustering algorithm uses Locality Sensitive Hashing (LSH) to cluster the nodes of the graph using Jaccard Index as the similarity measure. We employ recently proposed, weighted minwise sampling for randomized dimensionality reduction of given data set. Experimental results on benchmark data sets show that the proposed algorithm is able to capture the underlying community structure in complex networks.

[1]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[3]  Osmar R. Zaïane,et al.  Top Leaders Community Detection Approach in Information Networks , 2010 .

[4]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Joydeep Ghosh,et al.  Model-based overlapping clustering , 2005, KDD '05.

[6]  Steve Gregory,et al.  A Fast Algorithm to Find Overlapping Communities in Networks , 2008, ECML/PKDD.

[7]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  T. Nepusz,et al.  Fuzzy communities and the concept of bridgeness in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[10]  Piotr Indyk,et al.  Similarity Search in High Dimensions via Hashing , 1999, VLDB.

[11]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[12]  C. J. van Rijsbergen,et al.  FOUNDATION OF EVALUATION , 1974 .

[13]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

[14]  Anshumali Shrivastava,et al.  Exact Weighted Minwise Hashing in Constant Time , 2016, ArXiv.

[15]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  M. Meilă Comparing clusterings---an information based distance , 2007 .

[17]  Fergal Reid,et al.  Detecting highly overlapping community structure by greedy clique expansion , 2010, KDD 2010.

[18]  Ana L. N. Fred,et al.  Robust data clustering , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[19]  A. Clauset Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Malik Magdon-Ismail,et al.  Efficient Identification of Overlapping Communities , 2005, ISI.