$\mathcal{K}$ -Lowest-Influence Overlapping Nodes Based Community Detection in Complex Networks

Community detection is a classic and essential task in complex network analysis which aims at understanding their structural properties and functional organization. Community detection based on overlapping nodes has become one of the most popular methods in recent years. But, how to define the overlapping nodes in the real network is an important job. In this paper, we use the speaker-listener label propagation algorithm to find overlapping nodes. Second, we proposed a new metric which is based on local and global attributes to measure the node influence so as to evaluate the overlapping nodes’ importance. Community detection is realized with the $k$ -lowest-influence overlapping nodes deleting. Then, we assign the removed nodes into specific communities by voting to find the final community structure. The voting strategy is based on choosing the specific communities containing most of their neighbors. Finally, the extensive experiments on real-world networks demonstrate that our proposed method improves the quality of community detection methods and show both the effectiveness and efficiency of the method.

[1]  Tinghuai Ma,et al.  KDVEM : a k-degree anonymity with vertex and edge modification algorithm , 2015, Computing.

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

[3]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

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

[5]  Andrea Marino,et al.  Computing top-k Closeness Centrality Faster in Unweighted Graphs , 2019, TKDD.

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

[7]  Qiong Chen,et al.  Detecting local community structures in complex networks based on local degree central nodes , 2013 .

[8]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[9]  Tinghuai Ma,et al.  An efficient and scalable density-based clustering algorithm for datasets with complex structures , 2016, Neurocomputing.

[10]  Weifa Liang,et al.  Efficient Algorithms for the Identification of Top-$k$ Structural Hole Spanners in Large Social Networks , 2017, IEEE Transactions on Knowledge and Data Engineering.

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

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

[13]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[15]  Biswanath Dutta,et al.  Identifying influential spreaders in complex networks based on kshell hybrid method , 2018, Physica A: Statistical Mechanics and its Applications.

[16]  Jian Shen,et al.  $$\varvec{\textit{KDVEM}}$$KDVEM: a $$k$$k-degree anonymity with vertex and edge modification algorithm , 2015, Computing.

[17]  Boleslaw K. Szymanski,et al.  LabelRankT: incremental community detection in dynamic networks via label propagation , 2013, DyNetMM '13.

[18]  Philip S. Yu,et al.  Joint Community and Structural Hole Spanner Detection via Harmonic Modularity , 2016, KDD.

[19]  Haoran Wen,et al.  Improving community detection in networks by targeted node removal. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[22]  Steven B. Andrews,et al.  Structural Holes: The Social Structure of Competition , 1995, The SAGE Encyclopedia of Research Design.

[23]  Xiao-Dong Zhang,et al.  Finding overlapping communities using seed set , 2017 .

[24]  Chengzhi Zhang,et al.  Detecting Network Community by Propagating Labels Based on Contact-Specific Constraint , 2016 .

[25]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

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

[27]  Franz Rothlauf,et al.  PageRank centrality for performance prediction: the impact of the local optima network model , 2017, Journal of Heuristics.

[28]  Hua-Wei Shen,et al.  Detecting the Overlapping and Hierarchical Community Structure in Networks , 2013 .

[29]  Amedeo Caflisch,et al.  Multistep greedy algorithm identifies community structure in real-world and computer-generated networks , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[31]  Yong Deng,et al.  Identifying influential spreaders by weight degree centrality in complex networks , 2016 .

[32]  Natarajan Meghanathan,et al.  A computationally lightweight and localized centrality metric in lieu of betweenness centrality for complex network analysis , 2017, Vietnam Journal of Computer Science.

[33]  Xiaoheng Deng,et al.  Finding overlapping communities based on Markov chain and link clustering , 2016, Peer-to-Peer Networking and Applications.

[34]  Alfred O. Hero,et al.  Deep Community Detection , 2014, IEEE Transactions on Signal Processing.

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

[36]  Tinghuai Ma,et al.  Friends Classification of Ego Network Based on Combined Features , 2017 .

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

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

[39]  Weimin Li,et al.  Overlap community detection using spectral algorithm based on node convergence degree , 2018, Future Gener. Comput. Syst..

[40]  Yu Xue,et al.  A weighted collaboration network generalization method for privacy protection in C-DBLP , 2018, Intell. Data Anal..

[41]  Xiaoming Liu,et al.  SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process , 2011, 2011 IEEE 11th International Conference on Data Mining Workshops.

[42]  M. Newman,et al.  Identifying the role that animals play in their social networks , 2004, Proceedings of the Royal Society of London. Series B: Biological Sciences.

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

[44]  Tinghuai Ma,et al.  Deep rolling: A novel emotion prediction model for a multi-participant communication context , 2019, Inf. Sci..

[45]  Xiao Liu,et al.  Semi-supervised community detection based on non-negative matrix factorization with node popularity , 2017, Inf. Sci..

[46]  Tang Xianchao,et al.  network of American football games between Division IA colleges during regular season Fall 2000 , 2014 .

[47]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[48]  Tao Hu,et al.  Local modularity for community detection in complex networks , 2016 .

[49]  Yuan Tian,et al.  Protection of location privacy for moving kNN queries in social networks , 2017, Appl. Soft Comput..