1Anil K J. Data clustering:50 years beyond K-Means[J].Pattern Recognition Letters,2010,(08):651-666.
2Likas A,Vlassis M,Verbeek J. The global K-means clustering algorithm[J].Pattern Recognition,2003,(02):451-461.doi:10.1016/S0031-3203(02)00060-2.
3Selim S Z,Al-Sultan K S. Analysis of global K-means,an incremental heuristic for minimum sum-of-squares clustering[J].Journal of Classification,2005,(22):287-310.
4Bellman R,Dreyfus S. Applied dynamic programming[M].Princeton,New Jersey:Princeton University Press,1962.
5Aloise D,Deshpande A,Hansen P. NP-hardness of euclidean sum-of-squares clustering[J].Machine Learning,2009,(02):245-248.
6Mahajan M,Nimbor P,Varadarajan K. The planar K-means problem is NP-hard[J].Lecture Notes in Computer Science,2009,(5431):274-285.
7Ball G,Hall D. ISODATA,a novel method of data analysis and pattern classification[Technical rept. NTIS AD 699616. ][M].California:Stanford Research Institute,1965.
8WANG Cheng,LI Jiao-jiao,BAI Jun-qing. Max-Min K- means Clustering Algorithm and Application in Post-processing of Scientific Computing[A].Napoli,2011.7-9.
9Pena J M,Lozano J A,Larranaga P. An empirical comparison of four initialization methods for the K-means algorithm[J].Pattern Recognition Letters,1999,(20):1027-1040.doi:10.1016/S0167-8655(99)00069-0.
10Lai J Z C,Tsung-Jen H. Fast global K-means clustering using cluster membership and inequality[J].Pattern Recogni- tion,2010,(43):1954-1963.
