Journal of Xidian University ›› 2019, Vol. 46 ›› Issue (3): 167-172.doi: 10.19665/j.issn1001-2400.2019.03.025

Previous Articles     Next Articles

Improved spectral clustering community detection algorithm by combining the probability matrix

ZHANG Shubo,REN Shuxia,WU Tao   

  1. School of Computer Science and Software Engineering, Tianjin Polytechnic Univ., Tianjin 300387, China
  • Received:2018-12-27 Online:2019-06-20 Published:2019-06-19

Abstract:

Due to the fact that the similarity graphs of most spectral clustering algorithms carry lots of wrong community information, a probability 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.

Key words: probability matrix, spectral clustering, transition probability, Markov process, community detection, complex network

CLC Number: 

  • TP393.02