Complete graph model for community detection

Community detection brings plenty of considerable problems, which has attracted more attention for many years. This paper develops a new framework, which tries to measure the interior and the exterior of a community based on a same metric, complete graph model. In particular, the exterior is modeled as a complete bipartite. We partition a network into subnetworks by maximizing the difference between the interior and the exterior of the subnetworks. In addition, we compare our approach with some state of the art methods on computer-generated networks based on the LFR benchmark as well as real-world networks. The experimental results indicate that our approach obtains better results for community detection, is capable of splitting irregular networks and achieves perfect results on the karate network and the dolphin network.

[1]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[2]  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.

[3]  Luonan Chen,et al.  Quantitative function for community detection. , 2008 .

[4]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Dino Pedreschi,et al.  A classification for community discovery methods in complex networks , 2011, Stat. Anal. Data Min..

[6]  Chen Zhao,et al.  Analysis of the Chinese Airline Network as multi-layer networks , 2016 .

[7]  Lin Gao,et al.  Identification of overlapping and non-overlapping community structure by fuzzy clustering in complex networks , 2011, Inf. Sci..

[8]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

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

[10]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[11]  Peng Gang Sun,et al.  Imbalance problem in community detection , 2016 .

[12]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Martin Rosvall,et al.  An information-theoretic framework for resolving community structure in complex networks , 2007, Proceedings of the National Academy of Sciences.

[14]  Yang Gao,et al.  Adequate is better: particle swarm optimization with limited-information , 2015, Appl. Math. Comput..

[15]  Yang Yang,et al.  Methods to find community based on edge centrality , 2013 .

[16]  Yang Gao,et al.  Selectively-informed particle swarm optimization , 2015, Scientific Reports.

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

[18]  Alex Arenas,et al.  Analysis of the structure of complex networks at different resolution levels , 2007, physics/0703218.

[19]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[20]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[21]  Yang Yang,et al.  Maximizing modularity intensity for community partition and evolution , 2013, Inf. Sci..

[22]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[23]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[24]  Xiang-Sun Zhang,et al.  Modularity optimization in community detection of complex networks , 2009 .

[25]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

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

[27]  Martin Rosvall,et al.  Multilevel Compression of Random Walks on Networks Reveals Hierarchical Organization in Large Integrated Systems , 2010, PloS one.

[28]  Jing Li,et al.  Robust Local Community Detection: On Free Rider Effect and Its Elimination , 2015, Proc. VLDB Endow..

[29]  James P. Bagrow.  Evaluating local community methods in networks , 2007, 0706.3880.

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

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

[32]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

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

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

[35]  Hocine Cherifi,et al.  Comparative evaluation of community detection algorithms: a topological approach , 2012, ArXiv.

[36]  Massimo Marchiori,et al.  Method to find community structures based on information centrality. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[37]  Peng Gang Sun,et al.  A framework of mapping undirected to directed graphs for community detection , 2015, Inf. Sci..

[38]  James P. Bagrow,et al.  Communities and bottlenecks: trees and treelike networks have high modularity. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[40]  Peng Gang Sun,et al.  Weighting links based on edge centrality for community detection , 2014 .

[41]  Yiannis Kompatsiaris,et al.  Community detection in Social Media , 2012, Data Mining and Knowledge Discovery.