K-means clustering:: A half-century synthesis

被引:708
作者
Steinley, Douglas [1 ]
机构
[1] Univ Missouri, Dept Psychol Sci, Columbia, MO 65211 USA
关键词
D O I
10.1348/000711005X48266
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This paper synthesizes the results, methodology, and research conducted concerning the K-means clustering method over the last fifty years. The K-means method is first introduced, various formulations of the minimum variance loss function and alternative loss functions within the same class are outlined, and different methods of choosing the number of clusters and initialization, variable preprocessing, and data reduction schemes are discussed. Theoretic statistical results are provided and various extensions of K-means using different metrics or modifications of the original algorithm are given, leading to a unifying treatment of K-means and some of its extensions. Finally, several future studies are outlined that could enhance the understanding of numerous subtleties affecting the performance of the K-means method.
引用
收藏
页码:1 / 34
页数:34
相关论文
共 213 条
[1]   NEW LOOK AT STATISTICAL-MODEL IDENTIFICATION [J].
AKAIKE, H .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1974, AC19 (06) :716-723
[2]  
Anderberg M. R., 1973, CLUSTER ANAL APPL, DOI DOI 10.1016/C2013-0-06161-0
[3]  
Andersen P. B., 1992, Scandinavian Journal of Information Systems, V4, P3
[4]  
[Anonymous], SANKHYA A
[5]  
[Anonymous], 2001, PATTERN RECOGNITION
[6]  
[Anonymous], CLASSIFICATION DATA
[7]  
[Anonymous], 1970, SPEECH ANAL CLUSTERI
[8]  
[Anonymous], 1998, CLASSIFICATION DATA, DOI [DOI 10.1007/978-3-642-72087-1_20, 10.1007/978-3-642-72087-1_20]
[9]  
[Anonymous], 1996, Clustering and classification
[10]  
Arabie P., 1994, ADV METHODS MARKETIN, P160