A New Multi-View and Controllable Community-Uncovering Algorithm

This paper introduces a new multi-view and controllable community-uncovering algorithm, an achievement of improving PageRank algorithm and Spin-glass model, which can avoid the overlapping community structure in the process of detecting communities by means of other algorithms and also helps to improve the usual community-expansion model. The process of uncovering communities by the introduced algorithms can be divided into three steps: first, identifying the nuclear one among nodes ranked by the advanced PageRank algorithms; Second, through using multi-view recognition modularity provided by Potts spin-glass model, optimizing the expansion model of local community that is found by applying the improved Iterative Greedy algorithm to eliminate the traditional modularity’s limits in the resolution limit and the following negative effects. Finally, grasping the overlapping structure and notes carefully. By analyzing and comparing the two results of respectively using PRSGMFCA and traditional technical schemes in both computer simulation network and the real network, it proves that the former enjoys stronger stability and higher accuracy than the latter, and its computation complexity is also acceptable.

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

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

[3]  Lei Pan,et al.  Detecting Link Communities Based on Local Approach , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

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

[5]  L. Jiao,et al.  Two-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structure , 2014 .

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

[7]  Borut Žalik,et al.  A local multiresolution algorithm for detecting communities of unbalanced structures , 2014 .

[8]  Bin Liu,et al.  A Local Greedy Search Method for Detecting Community Structure in Weighted Social Networks , 2013, ADMA.

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

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

[11]  Mao-Bin Hu,et al.  Detect overlapping and hierarchical community structure in networks , 2008, ArXiv.

[12]  Jure Leskovec,et al.  Structure and Overlaps of Ground-Truth Communities in Networks , 2014, TIST.

[13]  Ignacio Marín,et al.  SurpriseMe: an integrated tool for network community structure characterization using Surprise maximization , 2013, Bioinform..

[14]  Chris Hankin,et al.  Fast multi-scale detection of overlapping communities using local criteria , 2014, Computing.

[15]  Kaveh Pahlavan,et al.  Modeling the Effect of Human Body on TOA Based Indoor Human Tracking , 2013, Int. J. Wirel. Inf. Networks.

[16]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

[17]  David Konopnicki,et al.  Microcosm: visual discovery, exploration and analysis of social communities , 2014, IUI Companion '14.