An efficient k-means clustering algorithms: Analysis and implementation

In k-means clustering, we are given a set of n data points in d-dimensional space R super(d) and an integer k and the problem is to determine a set of k points in R super(d), called centers, so as to minimize the mean squared distance from each data point to its nearest center. A popular heuristic f...

Full description

Bibliographic Details

Published in:	IEEE transactions on pattern analysis and machine intelligence Vol. 24; no. 7; pp. 881 - 892
Main Authors:	Kanungo, Tapas, Mount, David M, Netanyahu, Nathan S, Piatko, Christine D, Silverman, Ruth, Wu, Angela Y
Format:	Journal Article
Language:	English
Published:	01.07.2002
ISSN:	0162-8828
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!