A local search approximation algorithm for k-means clustering

In k-means clustering we are given a set of n data points in d-dimensional space R d and an integer  k, and the problem is to determine a set of  k points in  R d , called centers, to minimize the mean squared distance from each data point to its nearest center. No exact polynomial-time algorithms a...

Full description

Bibliographic Details

Published in:	Computational geometry : theory and applications Vol. 28; no. 2; pp. 89 - 112
Main Authors:	Kanungo, Tapas, Mount, David M., Netanyahu, Nathan S., Piatko, Christine D., Silverman, Ruth, Wu, Angela Y.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.06.2004
Subjects:	Approximation algorithms Clustering Computational geometry k-means Local search k-means Local search Computational geometry Approximation algorithms Clustering
ISSN:	0925-7721
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!