Exact Clustering of Weighted Graphs via Semidefinite Programming
From MaRDI portal
Publication:4633040
zbMath1483.62110arXiv1603.05296MaRDI QIDQ4633040
Brendan P. W. Ames, Aleksis Pirinen
Publication date: 2 May 2019
Full work available at URL: https://arxiv.org/abs/1603.05296
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Semidefinite programming (90C22) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
\(k\)-median: exact recovery in the extended stochastic ball model, Efficient, certifiably optimal clustering with applications to latent variable graphical models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Guaranteed clustering and biclustering via semidefinite programming
- Spectral clustering and the high-dimensional stochastic blockmodel
- Nuclear norm minimization for the planted clique and biclique problems
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation
- Recovery guarantees for exemplar-based clustering
- On semidefinite relaxations for the block model
- Consistency of spectral clustering in stochastic block models
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Convex optimization for the planted \(k\)-disjoint-clique problem
- Exact Recovery in the Stochastic Block Model
- Improved Graph Clustering
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- The highest dimensional stochastic blockmodel with a regularized estimator
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Approximating K‐means‐type Clustering via Semidefinite Programming
