Improved Graph Clustering
From MaRDI portal
Abstract: Graph clustering involves the task of dividing nodes into clusters, so that the edge density is higher within clusters as opposed to across clusters. A natural, classic and popular statistical setting for evaluating solutions to this problem is the stochastic block model, also referred to as the planted partition model. In this paper we present a new algorithm--a convexified version of Maximum Likelihood--for graph clustering. We show that, in the classic stochastic block model setting, it outperforms existing methods by polynomial factors when the cluster size is allowed to have general scalings. In fact, it is within logarithmic factors of known lower bounds for spectral methods, and there is evidence suggesting that no polynomial time algorithm would do significantly better. We then show that this guarantee carries over to a more general extension of the stochastic block model. Our method can handle the settings of semi-random graphs, heterogeneous degree distributions, unequal cluster sizes, unaffiliated nodes, partially observed graphs and planted clique/coloring etc. In particular, our results provide the best exact recovery guarantees to date for the planted partition, planted k-disjoint-cliques and planted noisy coloring models with general cluster sizes; in other settings, we match the best existing results up to logarithmic factors.
Cited in
(18)- Convex optimization for the densest subgraph and densest submatrix problems
- A simple spectral algorithm for recovering planted partitions
- On semidefinite relaxations for the block model
- Recovering nonuniform planted partitions via iterated projection
- Convex relaxation methods for community detection
- Exact recovery in the hypergraph stochastic block model: a spectral algorithm
- Graph clustering
- Exact clustering of weighted graphs via semidefinite programming
- Graph Clustering using Effective Resistance
- scientific article; zbMATH DE number 7307464 (Why is no real title available?)
- Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
- Estimating Mixed Memberships With Sharp Eigenvector Deviations
- k-median: exact recovery in the extended stochastic ball model
- Clustering probabilistic graphs using neighbourhood paths
- Clustering heterogeneous financial networks
- A Class of Random Matrices
- A (3+)-approximate correlation clustering algorithm in dynamic streams
- Fair community detection and structure learning in heterogeneous graphical models
This page was built for publication: Improved Graph Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986111)
