Sketch-and-solve approaches to k-means clustering by semidefinite programming

Author name not available (Why is that?)

Publication date: 28 November 2022

Abstract: We introduce a sketch-and-solve approach to speed up the Peng-Wei semidefinite relaxation of k-means clustering. When the data is appropriately separated we identify the k-means optimal clustering. Otherwise, our approach provides a high-confidence lower bound on the optimal k-means value. This lower bound is data-driven; it does not make any assumption on the data nor how it is generated. We provide code and an extensive set of numerical experiments where we use this approach to certify approximate optimality of clustering solutions obtained by k-means++.

Has companion code repository: https://github.com/kkylie/sketch-and-solve_kmeans

This page was built for publication: Sketch-and-solve approaches to k-means clustering by semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418800)