Cutoff for exact recovery of Gaussian mixture models

01/05/2020
by   Xiaohui Chen, et al.
0

We determine the cutoff value on separation of cluster centers for exact recovery of cluster labels in a K-component Gaussian mixture model with equal cluster sizes. Moreover, we show that a semidefinite programming (SDP) relaxation of the K-means clustering method achieves such sharp threshold for exact recovery without assuming the symmetry of cluster centers.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

12/19/2018

Sharp optimal recovery in the Two Gaussian Mixture Model

In this paper, we study the non-asymptotic problem of exact recovery in ...
07/09/2020

K-Means and Gaussian Mixture Modeling with a Separation Constraint

We consider the problem of clustering with K-means and Gaussian mixture ...
03/17/2018

Hidden Integrality of SDP Relaxation for Sub-Gaussian Mixture Models

We consider the problem of estimating the discrete clustering structures...
11/18/2020

Skewed Distributions or Transformations? Modelling Skewness for a Cluster Analysis

Because of its mathematical tractability, the Gaussian mixture model hol...
02/22/2016

Clustering subgaussian mixtures by semidefinite programming

We introduce a model-free relax-and-round algorithm for k-means clusteri...
01/20/2022

Sketch-and-Lift: Scalable Subsampled Semidefinite Program for K-means Clustering

Semidefinite programming (SDP) is a powerful tool for tackling a wide ra...
10/16/2017

When Do Birds of a Feather Flock Together? K-Means, Proximity, and Conic Programming

Given a set of data, one central goal is to group them into clusters bas...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.