A divisive spectral method for network community detection
From MaRDI portal
Abstract: Community detection is a fundamental problem in the domain of complex-network analysis. It has received great attention, and many community detection methods have been proposed in the last decade. In this paper, we propose a divisive spectral method for identifying community structures from networks, which utilizes a sparsification operation to pre-process the networks first, and then uses a repeated bisection spectral algorithm to partition the networks into communities. The sparsification operation makes the community boundaries more clearer and more sharper, so that the repeated spectral bisection algorithm extract high-quality community structures accurately from the sparsified networks. Experiments show that the combination of network sparsification and spectral bisection algorithm is highly successful, the proposed method is more effective in detecting community structures from networks than the others.
Recommendations
- Social network community detection using agglomerative spectral clustering
- Spectral clustering for community detection
- Detecting network communities: a new systematic and efficient algorithm
- Spectral based hypothesis testing for community detection in complex networks
- Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering
Cites work
- Community detection in networks via a spectral heuristic based on the clustering coefficient
- Community Detection Using Spectral Clustering on Sparse Geosocial Data
- Community structure in social and biological networks
- Detecting network communities: a new systematic and efficient algorithm
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Lower Bounds for the Partitioning of Graphs
- On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Personalized PageRank clustering: a graph clustering algorithm based on random walks
- Pseudo-likelihood methods for community detection in large sparse networks
- Spectral redemption in clustering sparse networks
Cited in
(14)- An algorithm J-SC of detecting communities in complex networks
- Social network community detection using agglomerative spectral clustering
- Spectral based hypothesis testing for community detection in complex networks
- Semi-supervised spectral algorithms for community detection in complex networks based on equivalence of clustering methods
- Community detection based on significance optimization in complex networks
- Predicting disease-related genes by path structure and community structure in protein-protein networks
- Phase Transitions in Spectral Community Detection
- Identifying multi-scale communities in networks by asymptotic surprise
- scientific article; zbMATH DE number 7307464 (Why is no real title available?)
- A signal-diffusion-based spectral clustering method for community detection
- A spectral method to detect community structure based on distance modularity matrix
- Bipartite communities via spectral partitioning
- Bipartite communities via spectral partitioning
- Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering
This page was built for publication: A divisive spectral method for network community detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3302576)
