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

page 1

page 2

page 3

page 4

research
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 ...
research
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 ...
research
03/17/2018

Hidden Integrality of SDP Relaxation for Sub-Gaussian Mixture Models

We consider the problem of estimating the discrete clustering structures...
research
09/29/2022

Likelihood adjusted semidefinite programs for clustering heterogeneous data

Clustering is a widely deployed unsupervised learning tool. Model-based ...
research
11/18/2020

Skewed Distributions or Transformations? Modelling Skewness for a Cluster Analysis

Because of its mathematical tractability, the Gaussian mixture model hol...
research
02/05/2023

Regularization and Global Optimization in Model-Based Clustering

Due to their conceptual simplicity, k-means algorithm variants have been...
research
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...

Please sign up or login with your details

Forgot password? Click here to reset