A Novel Method for Detecting New Overlapping Community in Complex Evolving Networks

It is an important challenge to detect an overlapping community and its evolving tendency in a complex network. To our best knowledge, there is no such an overlapping community detection method that exhibits high normalized mutual information (NMI) and ${F}$ -score, and can also predict an overlapping community’s future considering node evolution, activeness, and multiscaling. This paper presents a novel method based on node vitality, an extension of node fitness for modeling network evolution constrained by multiscaling and preferential attachment. First, according to a node’s dynamics such as link creation and destruction, we find node vitality by comparing consecutive network snapshots. Then, we combine it with the fitness function to obtain a new objective function. Next, by optimizing the objective function, we expand maximal cliques, reassign overlapping nodes, and find the overlapping community that matches not only the current network but also the future version of the network. Through experiments, we show that its NMI and ${F}$ -score exceed those of the state-of-the-art methods under diverse conditions of overlaps and connection densities. We also validate the effectiveness of node vitality for modeling a node’s evolution. Finally, we show how to detect an overlapping community in a real-world evolving network.

[1]  Xingyuan Wang,et al.  Approximating web communities using subspace decomposition , 2014, Knowl. Based Syst..

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

[3]  Tomas Olovsson,et al.  A local seed selection algorithm for overlapping community detection , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[4]  Xing-yuan Wang,et al.  Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks , 2014 .

[5]  Erik M Bollt,et al.  Local method for detecting communities. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Inderjit S. Dhillon,et al.  Overlapping Community Detection Using Neighborhood-Inflated Seed Expansion , 2015, IEEE Transactions on Knowledge and Data Engineering.

[7]  MengChu Zhou,et al.  Highly Efficient Framework for Predicting Interactions Between Proteins. , 2017, IEEE transactions on cybernetics.

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

[9]  Longbing Cao,et al.  Formalization and Verification of Group Behavior Interactions , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[10]  Yun Chi,et al.  Evolutionary spectral clustering by incorporating temporal smoothness , 2007, KDD '07.

[11]  Ping Wang,et al.  Cuckoo Search and Particle Filter-Based Inversing Approach to Estimating Defects via Magnetic Flux Leakage Signals , 2016, IEEE Transactions on Magnetics.

[12]  Huiling Jia,et al.  Trust Evaluation via Large-Scale Complex Service-Oriented Online Social Networks , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[13]  G. B. A. Barab'asi Competition and multiscaling in evolving networks , 2000, cond-mat/0011029.

[14]  Nanning Zheng,et al.  Parallel learning: a perspective and a framework , 2017, IEEE/CAA Journal of Automatica Sinica.

[15]  Jianbin Huang,et al.  Label propagation based evolutionary clustering for detecting overlapping and non-overlapping communities in dynamic networks , 2015, Knowl. Based Syst..

[16]  Wei Hu,et al.  Artificial bee colony algorithmbased parameter estimation of fractional-order chaotic system with time delay , 2017, IEEE/CAA Journal of Automatica Sinica.

[17]  Xingyuan Wang,et al.  Community detection using local neighborhood in complex networks , 2015 .

[18]  Deepayan Chakrabarti,et al.  Evolutionary clustering , 2006, KDD '06.

[19]  Derek Greene,et al.  Tracking the Evolution of Communities in Dynamic Social Networks , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.

[20]  Jiawei Han,et al.  A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks , 2009, Proc. VLDB Endow..

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

[22]  Xing-yuan Wang,et al.  Overlapping community detection using neighborhood ratio matrix , 2015 .

[23]  Fergal Reid,et al.  Title Detecting Highly Overlapping Community Structure by Greedy Clique Expansion Detecting Highly Overlapping Community Structure by Greedy Clique Expansion , 2022 .

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

[25]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

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

[28]  MengChu Zhou,et al.  Generating Highly Accurate Predictions for Missing QoS Data via Aggregating Nonnegative Latent Factor Models , 2016, IEEE Transactions on Neural Networks and Learning Systems.

[29]  Daqing Zhang,et al.  Modeling User Activity Preference by Leveraging User Spatial Temporal Characteristics in LBSNs , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[30]  Yun Chi,et al.  Facetnet: a framework for analyzing communities and their evolutions in dynamic networks , 2008, WWW.

[31]  Ke Hu,et al.  A novel dynamical community detection algorithm based on weighting scheme , 2015 .

[32]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[34]  Xingyuan Wang,et al.  Epidemic spreading in time-varying community networks , 2014, Chaos.

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

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

[37]  Xing-yuan Wang,et al.  Uncovering the overlapping community structure of complex networks by maximal cliques , 2014 .

[38]  Xingyuan Wang,et al.  Detecting overlapping communities by seed community in weighted complex networks , 2013 .

[39]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[41]  MengChu Zhou,et al.  Routing in Internet of Vehicles: A Review , 2015, IEEE Transactions on Intelligent Transportation Systems.

[42]  D. Defays,et al.  An Efficient Algorithm for a Complete Link Method , 1977, Comput. J..

[43]  Chris H Wiggins,et al.  Bayesian approach to network modularity. , 2007, Physical review letters.

[44]  Xiang Li,et al.  Human Interactive Patterns in Temporal Networks , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[45]  Domenico Rosaci,et al.  Trust and Compactness in Social Network Groups , 2015, IEEE Transactions on Cybernetics.

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

[47]  David Eppstein,et al.  Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time , 2010, Exact Complexity of NP-hard Problems.

[48]  Xing-yuan Wang,et al.  Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient , 2014 .

[49]  Xingyuan Wang,et al.  Uncovering overlapping community structures by the key bi-community and intimate degree in bipartite networks , 2014 .

[50]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[51]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[52]  Xing-yuan Wang,et al.  Asymmetric intimacy and algorithm for detecting communities in bipartite networks , 2016 .

[53]  MengChu Zhou,et al.  A Supervised Learning and Control Method to Improve Particle Swarm Optimization Algorithms , 2017, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[54]  Xing-yuan Wang,et al.  Detecting communities by the core-vertex and intimate degree in complex networks , 2013 .