# Learning Mixtures of Gaussians using the k-means Algorithm

@article{Chaudhuri2009LearningMO, title={Learning Mixtures of Gaussians using the k-means Algorithm}, author={Kamalika Chaudhuri and Sanjoy Dasgupta and Andrea Vattani}, journal={ArXiv}, year={2009}, volume={abs/0912.0086} }

One of the most popular algorithms for clustering in Euclidean space is the k-means algorithm; k-means is difficult to analyze mathematically, and few theoretical guarantees are known about it, particularly when the data is well-clustered. In this paper, we attempt to fill this gap in the literature by analyzing the behavior of k-means on well-clustered data. In particular, we study the case when each cluster is distributed as a different Gaussian – or, in other words, when the input comes from… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 24 CITATIONS

## Ten Steps of EM Suffice for Mixtures of Two Gaussians

VIEW 1 EXCERPT

CITES BACKGROUND

## A Single-Pass Algorithm for Efficiently Recovering Sparse Cluster Centers of High-dimensional Data

VIEW 6 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Structures of Spurious Local Minima in k-means

VIEW 2 EXCERPTS

CITES BACKGROUND & METHODS

## New directions in gaussian mixture learning and semi-supervised learning

VIEW 1 EXCERPT

CITES BACKGROUND

### FILTER CITATIONS BY YEAR

### CITATION STATISTICS

**1**Highly Influenced Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 27 REFERENCES

## k-Means Has Polynomial Smoothed Complexity

VIEW 2 EXCERPTS

## Separating populations with wide data: A spectral analysis

VIEW 2 EXCERPTS