Community Clustering Algorithm in Complex Networks Based on Microcommunity Fusion

With the further research on physical meaning and digital features of the community structure in complex networks in recent years, the improvement of effectiveness and efficiency of the community mining algorithms in complex networks has become an important subject in this area. This paper puts forward a concept of the microcommunity and gets final mining results of communities through fusing different microcommunities. This paper starts with the basic definition of the network community and applies Expansion to the microcommunity clustering which provides prerequisites for the microcommunity fusion. The proposed algorithm is more efficient and has higher solution quality compared with other similar algorithms through the analysis of test results based on network data set.

[1]  Zhetao Li,et al.  Survey of Community Structure Segmentation in Complex Networks , 2014, J. Softw..

[2]  Yan Sun,et al.  Cluster Analysis Based on Bipartite Network , 2014 .

[3]  Fang Wu,et al.  Finding communities in linear time: a physics approach , 2003, ArXiv.

[4]  Di Jin,et al.  Complex Network Clustering Algorithms: Complex Network Clustering Algorithms , 2009 .

[5]  Xin Liu,et al.  Effective Algorithm for Detecting Community Structure in Complex Networks Based on GA and Clustering , 2007, International Conference on Computational Science.

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

[7]  Yi Zhang,et al.  A new clustering algorithm based on data field in complex networks , 2013, The Journal of Supercomputing.

[8]  David A. Bader,et al.  Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

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

[10]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[11]  Madjid Khalilian,et al.  K-Means Divide and Conquer Clustering , 2009, 2009 International Conference on Computer and Automation Engineering.

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

[13]  Yang Bo,et al.  Complex Network Clustering Algorithms , 2009 .

[14]  Maoguo Gong,et al.  Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition , 2014, IEEE Transactions on Evolutionary Computation.

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

[16]  Jianwei Niu,et al.  A Novel Complex Networks Clustering Algorithm Based on the Core Influence of Nodes , 2014, TheScientificWorldJournal.

[17]  Iain Staffell,et al.  Divide and Conquer? ${k}$-Means Clustering of Demand Data Allows Rapid and Accurate Simulations of the British Electricity System , 2014, IEEE Transactions on Engineering Management.