## Abstract

In k-means clustering we are given a set of n data points in d-dimensional space ℜ^{d} and an integer k, and the problem is to determine a set of k points in ℜ^{d}, called centers, to minimize the mean squared distance from each data point to its nearest center. No exact polynomial-time algorithms are known for this problem. Although asymptotically efficient approximation algorithms exist, these algorithms are not practical due to the extremely high constant factors involved. There are many heuristics that are used in practice, but we know of no bounds on their performance. We consider the question of whether there exists a simple and practical approximation algorithm for k-means clustering. We present a local improvement heuristic based on swapping centers in and out. We prove that this yields a (9 + ε)-approximation algorithm. We show that the approximation factor is almost tight, by giving an example for which the algorithm achieves an approximation factor of (9 - ε). To establish the practical value of the heuristic, we present an empirical study that shows that, when combined with Lloyd's algorithm, tiffs heuristic performs quite well in practice.

Original language | English |
---|---|

Pages | 10-18 |

Number of pages | 9 |

DOIs | |

State | Published - 2002 |

Externally published | Yes |

Event | Proceedings of the 18th Annual Symposium on Computational Geometry (SCG'02) - Barcelona, Spain Duration: 5 Jun 2002 → 7 Jun 2002 |

### Conference

Conference | Proceedings of the 18th Annual Symposium on Computational Geometry (SCG'02) |
---|---|

Country/Territory | Spain |

City | Barcelona |

Period | 5/06/02 → 7/06/02 |

## Keywords

- Approximation algorithms
- Clustering
- Computational geometry
- Local search
- k-means