Community detection is an important way to describe the evolution of network events. In order to study.how to differentiate network community structure accurately and effectively, and solve the problem of the Sync clustering algorithm directly connected nodes without common neighbor nodes existing similarity underestimated tendency, and the synchronization time being too long, we put forward a method which breaks edge disconnection between connected nodes directly and add auxiliary nodes. We can think that the two nodes are connected by the secondary node and the edge of the two nodes connected respectively, and then realize the improvement of node similarity. Secondly this paper uses neighborhood radius to divide community, and detect the community before the node object has reacded fully synchronous. Simulation experiments are done respectively on the artificial data and real data sets generated, and the results show that the improved algorithm is more accurate to effectively find community structure compared with the original algorithm.
LimS. and RyuS., Overlapping community detection using the link-space transformation, IEEE 30th International Conference on Data Engineering (2014), 292–303.
2.
ZhangW.J. et al., Overlapping Community detection via link partion of asymmetric weighted graph, IEEE International Conference on Security (2014), 430–435.
3.
HuangJ.B. et al., Towards online multiresolution community detection in large-scale networks, Plos One6(8) (2011), 823–829.
4.
NewmanM.E.J., Detecting community structure in networks, European Physical Journal B38(2) (2004), 321–330.
5.
EustaceJ.WangX. and GuiY., Overlapping community detection using neighborhood ratio matrix, Physica a Statistical Mechanics and its Applications421 (2015), 510–521.
6.
ZhouT.LvL.Y. and ZhangY.C., Predicting miss-ing links via local information, European Physical Journal B71(4) (2009), 623–630.
7.
LeichtE.A.HolmeP. and NewmanM.E., Vertex similarity in networks, Physical Review E Statistical Nonlinear and Soft Matter Physics73(2) (2006), 261–271.
8.
PonsP. and LatapyM., Computing communities in large networks using random walks, in: Proc, In-ternational Symposium on Computer and Information Sciences2005, pp. 284–293.
9.
ZhangG. et al., Hierarchical search result clustering method, Journal of Computer Research and Development45(3) (2008), 542–547.
10.
PlantC. et al., Clustering by synchronization, in: Proc. ACM SIGKDD International Conference on Knowl-edge Discovery and Data Mining, 2010, pp. 583–592.
11.
HuangJ. et al., A dynamic model based on synchronous network community discovery method, Research and Development of the Computer49(10) (2012), 2198–2207.
12.
KuramotoY., Self-entrainment of a population of coupled non-linear oscillators, in: Proc. International Symposium on Mathematical Problems in Theoretical Physics, 1975, pp. 420–422.
13.
DuanL.StreetW.N.LiuY. et al., Community detection in graphs through correlation, in: Proc. ACMSIGKDD International Conference on Know Discovery and Data Mining, 2014, pp. 1376–1385.
14.
ZacharyW.W., An information flow model for conflict and fission in small groups, Journal of Anthro-Pological Research33(4) (1977), 452–473.
15.
XuX.W. et al., A structural clustering algo-rithm for networks, in: proc. PACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007, pp. 824–833.
16.
RezaeeJ.A. and JasronitaJ., Parricle swarm optimisation for discrete optimisation problems, Artificial Intelligence Review43(2) (2015), 243–254.
17.
ChenL.ZhangJ.CaiL. et al., A cross-jobs-cross-phases map-reduce scheduling algorithm in heterogeneous cloud, Journal of Computers28(2) (2017), 145–164.
18.
XuH.L.NingN.W. and NiuL.J., Propagation algorithm for community detection based on vertex local influence, Journal of Chinese Computer Systems38(6) (2017), 1299–1304.
19.
XuC.L.ChenZ.G.HuangR. et al., LPA_LRDC tag propagation community discovery algorithm based on optimized LeaderRank, Journal of Chinese Computer Systems38(8) (2017),1 746–1750.
20.
LyuL.ZhouT.ZhangQ.M. et al., The H-index of a network node and its relation to degree and coreness, Nature Communications (2016), 168–178.
21.
QiJ.S.LiangX. and WangY., Overlapping community detection algorithm based on selection of seed nodes, Application Research of Computers34(12) (2017), 3534–3537.
22.
LiuS.C.ZhuF.X. and LinC., A lable propagation propagation probability based algorithm for overlapping community detection, Chinese Journal of Computers39(4) (2016), 717–729.
23.
DengK.LiW.P. and YuF.H., Overlapping community detection in complex networks base on multi kernel label propagation, Journal on Communications38(2) (2017), 53–66.
24.
LiuZ.J. et al., An algorithm of wireless network resource allocation in C-RAN, Journal of Computational Methods in Sciences and Engineering (2015), 729–736.
25.
WenZ.C. and HeP.J., Network security situation abnormal detection method based on hypothesis test, Journal of Computational Methods in Sciences and Engineering (2016), 505–518.
26.
WenZ.C. and TangJ., Quantitative assessment for network security situation based on weighted factors, Journal of Computational Methods in Sciences and Engineering (2016), 821–833.
27.
JiaX.Q., A social networks routing algorithm of resisting Sybil attack based on P2P, Journal of Computational Methods in Sciences and Engineering (2016), 877–898.
