An improved spectral clustering community detection algorithm based on probability matrix
Summary: The similarity graphs of most spectral clustering algorithms carry lots of wrong community information. In this paper, we propose a probability matrix and a novel improved spectral clustering algorithm based on the probability matrix for community detection. First, the Markov chain is used to calculate the transition probability between nodes, and the probability matrix is constructed by the transition probability. Then, the similarity graph is constructed with the mean probability matrix. Finally, community detection is achieved by optimizing the NCut objective function. The proposed algorithm is compared with SC, WT, FG, FluidC, and SCRW on artificial networks and real networks. Experimental results show that the proposed algorithm can detect communities more accurately and has better clustering performance.
- Markov spectral clustering algorithm with DCBM for community detection
- Spectral clustering for community detection
- A signal-diffusion-based spectral clustering method for community detection
- An improved spectral clustering algorithm based on random walk
- An improved local community detection algorithm using selection probability
- An Efficient Heuristic Procedure for Partitioning Graphs
- An improved spectral clustering algorithm based on random walk
- Community structure in social and biological networks
- Computing Communities in Large Networks Using Random Walks
- Evaluating accuracy of community detection using the relative normalized mutual information
- Social network community detection using agglomerative spectral clustering
- Unified theory for finite Markov chains
- An improved local community detection algorithm using selection probability
- Phase transition in spectral clustering based on resistance matrix
- Markov spectral clustering algorithm with DCBM for community detection
- A similarity graph construction method based on Markov random walker for spectral clustering
- An improved spectral clustering algorithm based on random walk
- scientific article; zbMATH DE number 7266663 (Why is no real title available?)
- A signal-diffusion-based spectral clustering method for community detection
- Improved community partition algorithm based on similarity voting
- Community detection based on spectral clustering with node attributes
This page was built for publication: An improved spectral clustering community detection algorithm based on probability matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782099)
