An improved spectral clustering community detection algorithm based on probability matrix
From MaRDI portal
Recommendations
- 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
Cites work
- 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
Cited in
(8)- Markov spectral clustering algorithm with DCBM for community detection
- scientific article; zbMATH DE number 7266663 (Why is no real title available?)
- Improved community partition algorithm based on similarity voting
- An improved spectral clustering algorithm based on random walk
- Community detection based on spectral clustering with node attributes
- A similarity graph construction method based on Markov random walker for spectral clustering
- A signal-diffusion-based spectral clustering method for community detection
- An improved local community detection algorithm using selection probability
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)
