摘要
针对目前谱聚类算法的相似图包含较多错误社区信息的问题,引入了概率矩阵的概念,提出了一种改进的谱聚类社区发现算法。该算法首先利用马尔可夫过程计算节点间的转移概率,并基于转移概率构建复杂网络的概率矩阵;然后以均值概率矩阵重新构造相似图;最后通过优化归一化切割函数实现社区划分。采用人工网络和现实网络与其他典型算法进行对比实验,实验结果表明,该算法能够更加精准地划分社区,具有更加良好的聚类性能。
Due to the fact that the similarity graphs of most spectral clustering algorithms carry lots of wrong community information,aprobability matrix and a novel improved spectral clustering algorithm for community detection are proposed.First,the Markov process is used to calculate the transition probability between nodes,and the probability matrix of a complex network is constructed by the transition probability.Then the similarity graph is reconstructed with the mean probability matrix.Finally,the community detection is achieved by optimizing the normalized cuts function.The proposed algorithm is compared with other classical algorithms on artificial networks and real networks.The results show that our algorithm can cluster the community more accurately and has a better clustering performance.
引文
[1]GIRVAN M,NEWMAN M E J.Community Structure in Social and Biological Networks[J].Proceedings of the National Academy of Sciences of the United States of America,2002,99(12):7821-7826.
[2]付立冬,马小科,聂靖靖.进化谱分算法检测动态网络社团结构[J].西安电子科技大学学报,2018,45(2):43-47+53.FU Lidong,MA Xiaoke,NIE Jingjing.Evolutionary Spectral Approach to Finding Communties in Dynamic Networks[J].Journal of Xidian University,2018,45(2):43-47+53.
[3]JIANJUN C,XINHONG Y,QI L,et al.Voting Simulation Based Agglomerative Hierarchical Method for Network Community Detection[J].Scientific Reports,2018,8(1):8064-8075.
[4]DE GUZZI BAGNATO G,RONQUI J R F,TRAVIESO G.Community Detection in Networks Using Self-avoiding Random Walks[J].Physica A:Statistical Mechanics and Its Applications,2018,505:1046-1055.
[5]NG A Y,JORDAN M I,WEISS Y.On Spectral Clustering:Analysis and an Algorithm[CA/OL].[2018-11-20].https://papers.nips.cc/paper/2092-on-spectral-clustering-analysis-and-an-algorithm.pdf.
[6]XUANMEI Q,WEIDI D,PENGFEI J,et al.A Multi-similarity Spectral Clustering Method for Community Detection in Dynamic Networks[J].Scientific Reports,2016,6:31454.
[7]NARANTSATSRALT U U,KANG S.Social Network Community Detection Using Agglomerative Spectral Clustering[J].Complexity,2017,2017:1-10.
[8]GUI C,ZHANG R,HU R,et al.Overlapping Communities Detection Based on Spectral Analysis of Line Graphs[J].Physica A:Statistical Mechanics and Its Applications,2018,498:50-65.
[9]LI X,CHENG X,SU S,et al.Community-based Seeds Selection Algorithm for Location Aware Influence Maximization[J].Neurocomputing,2018,275:1601-1613.
[10]ZHANG X C,YOU Q.An Improved Spectral Clustering Algorithm Based on Random Walk[J].Frontiers of Computer Science in China,2011,5(3):268-278.
[11]WANG B,ZHANG L,WU C,et al.Spectral Clustering Based on Similarity and Dissimilarity Criterion[J].Pattern Analysis and Applications,2017,20(2):495-506.
[12]SUN P G,SUN X.Complete Graph Model for Community Detection[J].Physica A:Statistical Mechanics and Its Applications,2017,471:88-97.
[13]AMELIO A,PIZZUTI C.Correction for Closeness:Adjusting Normalized Mutual Information Measure for Clustering Comparison[J].Computational Intelligence,2017,33(3):579-601.
[14]RABBANY R,ZAANE O R.Generalization of Clustering Agreements and Distances for Overlapping Clusters and Network Communities[J].Data Mining and Knowledge Discovery,2015,29(5):1458-1485.
[15]SAOUD B,MOUSSAOUI A.Community Detection in Networks Based on Minimum Spanning Tree and Modularity[J].Physica A:Statistical Mechanics and Its Applications,2016,460:230-234.
[16]PONS P,LATAPY M.Computing Communities in Large Networks Using Random Walks[C]//Lecture Notes in Computer Science:3733.Heidelberg:Springer Verlag,2005:284-293.
[17]NEWMAN M E J.Fast Algorithm for Detecting Community Structure in Networks[J].Physical Review E-Statistical,Nonlinear,Soft Matter Physics,2004,69(62):066133.
[18]PARES F,GARCIA-GASULLA D,VILALTA A,et al.Fluid Communities:A Competitive,Scalable and Diverse Community Detection Algorithm[C]//Proceedings of the 2017 6th Complex Networks&Their Applications.Heidelberg:Springer,2017:229-240.