Research on of overlapping community detection algorithm based on tag influence

Because of the overlapping community detection algorithm is random and easily forms the monster community, an overlapping community detection algorithm OCDA_TI based on tag influence is proposed in this paper. Firstly, the concept of subordinate degree that represents the ascription degree for this community vertices in different communities is defined in the algorithm; secondly, for the problem that the attraction between tag vertex will weaken according to the tag propagation distance increases, tag score and the attenuation factor is described. In order to avoid the problem of random selection of same label influence, the similarity measure is defined; thirdly, the calculation method of tag influence value and the termination condition of tag transmission are given based on the subordinate degree function and attenuation factor. Considering that the network structure is difficult to determine the attenuation factor, the propagation distance parameter is introduced, which combines the modularity increment maximum; Finally, the testing of the OCDA_TI algorithm in different data sets, the experimental results show that the proposed algorithm has good stability, and the quality of community detection is superior to the typical overlapping community detection algorithms.

[1]  T. Vicsek,et al.  Weighted network modules , 2007, cond-mat/0703706.

[2]  V. Carchiolo,et al.  Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.

[3]  Tang Jinhui,et al.  Overlapping community detection based on node location analysis , 2016 .

[4]  J. Kumpula,et al.  Sequential algorithm for fast clique percolation. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[6]  Jinhui Tang,et al.  Overlapping community detection based on node location analysis , 2016, Knowl. Based Syst..

[7]  T. Murata,et al.  Advanced modularity-specialized label propagation algorithm for detecting communities in networks , 2009, 0910.1154.

[8]  B. Biswal,et al.  A model for evolution of overlapping community networks , 2017 .

[9]  M. Barber,et al.  Detecting network communities by propagating labels under constraints. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Yao Wang,et al.  LED: A fast overlapping communities detection algorithm based on structural clustering , 2016, Neurocomputing.

[11]  Huaiyu Wan,et al.  Efficient overlapping community detection in huge real-world networks , 2012, Physica A: Statistical Mechanics and its Applications.

[12]  S. Lehmann,et al.  Biclique communities. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[14]  Xu Zhou,et al.  A density based link clustering algorithm for overlapping community detection in networks , 2017 .

[15]  Wang Jian,et al.  An overview on overlapping community detection , 2012, 2012 7th International Conference on Computer Science & Education (ICCSE).

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

[17]  Qin Ma,et al.  A link density clustering algorithm based on automatically selecting density peaks for overlapping community detection , 2016 .

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

[19]  E. Poovammal,et al.  An Analysis of Overlapping Community Detection Algorithms in Social Networks , 2016 .

[20]  Huaiyu Wan,et al.  Balanced Multi-Label Propagation for Overlapping Community Detection in Social Networks , 2012, Journal of Computer Science and Technology.

[21]  Sudeep Basu,et al.  Overlapping Community Detection Through Threshold Analysis on Disjoint Network Structures , 2018 .