K-Means and Gaussian Mixture Modeling with a Separation Constraint

07/09/2020
by   He Jiang, et al.
0

We consider the problem of clustering with K-means and Gaussian mixture models with a constraint on the separation between the centers in the context of real-valued data. We first propose a dynamic programming approach to solving the K-means problem with a separation constraint on the centers, building on (Wang and Song, 2011). In the context of fitting a Gaussian mixture model, we then propose an EM algorithm that incorporates such a constraint. A separation constraint can help regularize the output of a clustering algorithm, and we provide both simulated and real data examples to illustrate this point.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 13

01/05/2020

Cutoff for exact recovery of Gaussian mixture models

We determine the cutoff value on separation of cluster centers for exact...
11/23/2017

Clustering Semi-Random Mixtures of Gaussians

Gaussian mixture models (GMM) are the most widely used statistical model...
05/04/2020

How many modes can a constrained Gaussian mixture have?

We show, by an explicit construction, that a mixture of univariate Gauss...
06/05/2021

Sparsification for Sums of Exponentials and its Algorithmic Applications

Many works in signal processing and learning theory operate under the as...
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...
06/28/2020

Breathing k-Means

We propose a new algorithm for the k-means problem which repeatedly incr...
03/17/2018

Hidden Integrality of SDP Relaxation for Sub-Gaussian Mixture Models

We consider the problem of estimating the discrete clustering structures...
This week in AI

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