FOCS: Fast Overlapped Community Search

Discovery of natural groups of similarly functioning individuals is a key task in analysis of real world networks. Also, overlap between community pairs is commonplace in large social and biological graphs, in particular. In fact, overlaps between communities are known to be denser than the non-overlapped regions of the communities. However, most of the existing algorithms that detect overlapping communities assume that the communities are denser than their surrounding regions, and falsely identify overlaps as communities. Further, many of these algorithms are computationally demanding and thus, do not scale reasonably with varying network sizes. In this article, we propose Fast Overlapped Community Search (FOCS), an algorithm that accounts for local connectedness in order to identify overlapped communities. FOCS is shown to be linear in number of edges and nodes. It additionally gains in speed via simultaneous selection of multiple near-best communities rather than merely the best, at each iteration. FOCS outperforms some popular overlapped community finding algorithms in terms of computational time while not compromising with quality.

[1]  Hsinchun Chen,et al.  Criminal network analysis and visualization , 2005, CACM.

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

[3]  Neil J. Hurley,et al.  Detecting Highly Overlapping Communities with Model-Based Overlapping Seed Expansion , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.

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

[5]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[6]  Hamidreza Alvari,et al.  Discovering overlapping communities in social networks: A novel game-theoretic approach , 2013, AI Commun..

[7]  R. Lambiotte,et al.  Line graphs, link partitions, and overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[10]  Boleslaw K. Szymanski,et al.  LabelRank: A stabilized label propagation algorithm for community detection in networks , 2013, 2013 IEEE 2nd Network Science Workshop (NSW).

[11]  T. S. Evans,et al.  Clique graphs and overlapping communities , 2010, ArXiv.

[12]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[13]  Robert E. Tarjan,et al.  Finding Strongly Knit Clusters in Social Networks , 2008, Internet Math..

[14]  Sougata Mukherjea,et al.  Social ties and their relevance to churn in mobile telecom networks , 2008, EDBT '08.

[15]  Dino Pedreschi,et al.  DEMON: a local-first discovery method for overlapping communities , 2012, KDD.

[16]  Michel Crampes,et al.  Survey on Social Community Detection , 2013, Social Media Retrieval.

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

[18]  Boleslaw K. Szymanski,et al.  Community detection using a neighborhood strength driven Label Propagation Algorithm , 2011, 2011 IEEE Network Science Workshop.

[19]  C. Landry,et al.  An in Vivo Map of the Yeast Protein Interactome , 2008, Science.

[20]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[21]  Malik Magdon-Ismail,et al.  SSDE-Cluster: Fast Overlapping Clustering of Networks Using Sampled Spectral Distance Embedding and GMMs , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[22]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[23]  S. Feld.  The Focused Organization of Social Ties , 1981, American Journal of Sociology.

[24]  Wei Chen,et al.  A game-theoretic framework to identify overlapping communities in social networks , 2010, Data Mining and Knowledge Discovery.

[25]  William Stafford Noble,et al.  Large-scale identification of yeast integral membrane protein interactions. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[26]  Serafeim Tsironis,et al.  Accurate Spectral Clustering for Community Detection in MapReduce , 2013 .

[27]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[28]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[29]  Boleslaw K. Szymanski,et al.  Towards Linear Time Overlapping Community Detection in Social Networks , 2012, PAKDD.

[30]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[31]  A. Barabasi,et al.  High-Quality Binary Protein Interaction Map of the Yeast Interactome Network , 2008, Science.

[32]  Jure Leskovec,et al.  Structure and Overlaps of Communities in Networks , 2012, KDD 2012.

[33]  Y. Narahari,et al.  A game theory inspired, decentralized, local information based algorithm for community detection in social graphs , 2012, Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012).

[34]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[35]  Aristides Gionis,et al.  Overlapping Correlation Clustering , 2011, ICDM.

[36]  Katsuhiko Murakami,et al.  PCDq: human protein complex database with quality index which summarizes different levels of evidences of protein complexes predicted from H-Invitational protein-protein interactions integrative dataset , 2012, BMC Systems Biology.

[37]  S. Pu,et al.  Up-to-date catalogues of yeast protein complexes , 2008, Nucleic acids research.

[38]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[39]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[40]  Jure Leskovec,et al.  Defining and Evaluating Network Communities Based on Ground-Truth , 2012, ICDM.

[41]  Malik Magdon-Ismail,et al.  Finding communities by clustering a graph into overlapping subgraphs , 2005, IADIS AC.

[42]  Mathieu Bastian,et al.  Gephi: An Open Source Software for Exploring and Manipulating Networks , 2009, ICWSM.

[43]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[44]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[45]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[46]  Jure Leskovec,et al.  Overlapping community detection at scale: a nonnegative matrix factorization approach , 2013, WSDM.