Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
From MaRDI portal
Publication:4614130
Recommendations
- Diffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxations
- Efficient, certifiably optimal clustering with applications to latent variable graphical models
- Semidefinite spectral clustering
- Clustering subgaussian mixtures by semidefinite programming
- scientific article; zbMATH DE number 5957371
Cites work
- A Biclustering Framework for Consensus Problems
- A Limited Memory Algorithm for Bound Constrained Optimization
- Algorithms for learning kernels based on centered alignment
- Algorithms for nonnegative matrix factorization with the \(\beta\)-divergence
- An alternating direction algorithm for matrix completion with nonnegative factors
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Clustering subgaussian mixtures by semidefinite programming
- Compressed Nonnegative Matrix Factorization Is Fast and Accurate
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs
- Invariant Semidefinite Programs
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning the kernel matrix with semidefinite programming
- Least squares quantization in PCM
- On nonnegative factorization of matrices
- On semidefinite relaxations for the block model
- On the Matrix Equation X′X = A
- Phase transitions in semidefinite relaxations
- Relax, no need to round: integrality of clustering formulations
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Sparse Approximate Solutions to Semidefinite Programs
- The Split Bregman Method for L1-Regularized Problems
Cited in
(4)- Diffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxations
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
- Efficient, certifiably optimal clustering with applications to latent variable graphical models
This page was built for publication: Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4614130)
