Approximating K‐means‐type Clustering via Semidefinite Programming
From MaRDI portal
Publication:5444287
DOI10.1137/050641983zbMath1146.90046MaRDI 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
Unnamed Item, Improved Conic Reformulations for $K$-means Clustering, Clustering subgaussian mixtures by semidefinite programming, Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization, Non-convex clustering via proximal alternating linearized minimization method, Exact Clustering of Weighted Graphs via Semidefinite Programming, Unnamed Item, Unnamed Item, Improving spectral bounds for clustering problems by Lagrangian relaxation, SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0), Covariate Regularized Community Detection in Sparse Graphs, Unnamed Item, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, The Ratio-Cut Polytope and K-Means Clustering, Joint Community Detection and Rotational Synchronization via Semidefinite Programming, SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering, 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, A new perspective on low-rank optimization, A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization, A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming, Mixed-integer programming techniques for the minimum sum-of-squares clustering problem, Semidefinite programming based community detection for node-attributed networks and multiplex networks, Guaranteed clustering and biclustering via semidefinite programming, SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints, On the minimum of the mean-squared error in 2-means clustering, Probably certifiably correct \(k\)-means clustering, On semidefinite relaxations for the block model, An efficient approach to solve the large-scale semidefinite programming problems, Ensemble clustering using semidefinite programming with applications, Convex relaxation methods for community detection, Optimality of spectral clustering in the Gaussian mixture model, Distance preserving model order reduction of graph-Laplacians and cluster analysis, An empirical comparison of two approaches for CDPCA in high-dimensional data, Model assisted variable clustering: minimax-optimal recovery and algorithms, Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering, Hanson-Wright inequality in Hilbert spaces with application to \(K\)-means clustering for non-Euclidean data, On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming, When do birds of a feather flock together? \(k\)-means, proximity, and conic programming, Partial recovery bounds for clustering with the relaxed \(K\)-means, Fuzzy clustering: more than just fuzzification, Efficient, certifiably optimal clustering with applications to latent variable graphical models, Diffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxations, Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering, An exact algorithm for semi-supervised minimum sum-of-squares clustering, An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming
Uses Software
