Guaranteed clustering and biclustering via semidefinite programming
From MaRDI portal
Publication:463740
DOI10.1007/s10107-013-0729-xzbMath1297.90107arXiv1202.3663OpenAlexW1965656937MaRDI QIDQ463740
Publication date: 17 October 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.3663
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Clustering in the social and behavioral sciences (91C20) Semidefinite programming (90C22)
Related Items
Goodness-of-fit test for latent block models ⋮ A simple spectral algorithm for recovering planted partitions ⋮ \(k\)-median: exact recovery in the extended stochastic ball model ⋮ Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation ⋮ Recovery guarantees for exemplar-based clustering ⋮ Efficient, certifiably optimal clustering with applications to latent variable graphical models ⋮ Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization ⋮ Unnamed Item ⋮ Tightness of the maximum likelihood semidefinite relaxation for angular synchronization ⋮ Recovering nonuniform planted partitions via iterated projection ⋮ Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] ⋮ Finding the Largest Low-Rank Clusters With Ky Fan $2$-$k$-Norm and $\ell_1$-Norm ⋮ Convex relaxation methods for community detection ⋮ Convex optimization for the densest subgraph and densest submatrix problems ⋮ Profile likelihood biclustering ⋮ Exact recovery in the hypergraph stochastic block model: a spectral algorithm ⋮ Exact Clustering of Weighted Graphs via Semidefinite Programming ⋮ Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Null space conditions and thresholds for rank minimization
- Spectral clustering and the high-dimensional stochastic blockmodel
- Correlation clustering
- Nuclear norm minimization for the planted clique and biclique problems
- NP-hardness of Euclidean sum-of-squares clustering
- A limit theorem for the norm of random matrices
- The eigenvalues of random symmetric matrices
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Ensemble clustering using semidefinite programming with applications
- Convex optimization for the planted \(k\)-disjoint-clique problem
- Biclustering in data mining
- Exact matrix completion via convex optimization
- Remarks on the Notion of Order of Difference Equations
- Decoding by Linear Programming
- Probing the Pareto Frontier for Basis Pursuit Solutions
- On clusterings
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Probability Inequalities for Sums of Bounded Random Variables
- The effectiveness of lloyd-type methods for the k-means problem
- A Simpler Approach to Matrix Completion
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: Guaranteed clustering and biclustering via semidefinite programming
