The analysis of a simple k-means clustering algorithm

SCG '00: Proceedings of the sixteenth annual symposium on Computational geometry(2000)

引用 160|浏览2
暂无评分
摘要
K-means clustering is a very popular clustering technique which is used in numerous applications.Given a set of n data points in Rdand an integer k, the problem is to determine a setof k points Rd, called centers, so as to minimize the mean squared distance from each datapoint to its nearest center. A popular heuristic for k-means clustering is Lloyd's algorithm.In this paper we present a simple and efficient implementation of Lloyd's k-means clusteringalgorithm, which we call the...
更多
查看译文
关键词
simple k-means,quantization,k means,k means clustering,clustering,information retrieval,data compression,algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要