Improved Graph Clustering

DOI10.1109/TIT.2014.2346205zbMath1360.94499arXiv1210.3335MaRDI QIDQ2986111

Huan Xu, Sujay Sanghavi, Yudong Chen

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.3335

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (13)

Estimating Mixed Memberships With Sharp Eigenvector Deviations ⋮ A simple spectral algorithm for recovering planted partitions ⋮ \(k\)-median: exact recovery in the extended stochastic ball model ⋮ Clustering probabilistic graphs using neighbourhood paths ⋮ Clustering heterogeneous financial networks ⋮ On semidefinite relaxations for the block model ⋮ Recovering nonuniform planted partitions via iterated projection ⋮ Convex relaxation methods for community detection ⋮ Convex optimization for the densest subgraph and densest submatrix problems ⋮ Exact recovery in the hypergraph stochastic block model: a spectral algorithm ⋮ Exact Clustering of Weighted Graphs via Semidefinite Programming ⋮ Unnamed Item ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model

This page was built for publication: Improved Graph Clustering