Approximating K‐means‐type Clustering via Semidefinite Programming
From MaRDI portal
Publication:5444287
DOI10.1137/050641983zbMath1146.90046OpenAlexW1986219860MaRDI QIDQ5444287
Publication date: 25 February 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050641983
Related Items (48)
On the minimum of the mean-squared error in 2-means clustering ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ The Ratio-Cut Polytope and K-Means Clustering ⋮ Improved Conic Reformulations for $K$-means Clustering ⋮ Fuzzy clustering: more than just fuzzification ⋮ Diffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxations ⋮ Model assisted variable clustering: minimax-optimal recovery and algorithms ⋮ Probably certifiably correct \(k\)-means clustering ⋮ Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering ⋮ Joint Community Detection and Rotational Synchronization via Semidefinite Programming ⋮ An exact algorithm for semi-supervised minimum sum-of-squares clustering ⋮ A new perspective on low-rank optimization ⋮ A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization ⋮ Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering ⋮ Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing ⋮ SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering ⋮ A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming ⋮ Solving graph equipartition SDPs on an algebraic variety ⋮ Unnamed Item ⋮ Efficient, certifiably optimal clustering with applications to latent variable graphical models ⋮ Mixed-integer programming techniques for the minimum sum-of-squares clustering problem ⋮ Semidefinite programming based community detection for node-attributed networks and multiplex networks ⋮ Clustering subgaussian mixtures by semidefinite programming ⋮ An efficient approach to solve the large-scale semidefinite programming problems ⋮ Hanson-Wright inequality in Hilbert spaces with application to \(K\)-means clustering for non-Euclidean data ⋮ Ensemble clustering using semidefinite programming with applications ⋮ Guaranteed clustering and biclustering via semidefinite programming ⋮ On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming ⋮ Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization ⋮ Non-convex clustering via proximal alternating linearized minimization method ⋮ SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints ⋮ Unnamed Item ⋮ On semidefinite relaxations for the block model ⋮ Improving spectral bounds for clustering problems by Lagrangian relaxation ⋮ When do birds of a feather flock together? \(k\)-means, proximity, and conic programming ⋮ Convex relaxation methods for community detection ⋮ An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) ⋮ Distance preserving model order reduction of graph-Laplacians and cluster analysis ⋮ An empirical comparison of two approaches for CDPCA in high-dimensional data ⋮ Exact Clustering of Weighted Graphs via Semidefinite Programming ⋮ Partial recovery bounds for clustering with the relaxed \(K\)-means ⋮ Unnamed Item ⋮ Covariate Regularized Community Detection in Sparse Graphs ⋮ Unnamed Item ⋮ A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
Uses Software
This page was built for publication: Approximating K‐means‐type Clustering via Semidefinite Programming