1G.Karypis,E H Han,VKumar. CHAMELEON:A hierarchical clusteringalgorithm using dynamic modeling [J]. Computer, 1999, 32.
2BottouL,Bengio Y. ConvergencePropertiesoftheK-Means Algorithms[M]. Advances in Neural Information Processing System 7 TesauroG.,et al.(eds-)., MIT Press, Cambridge, MA, 1995: 585-592.
3TreshanskyA, McGraw R. An overview of clustering algorithms [C]//ProceedingsoffiPIE, The InternationalSocietyforOptical Engineering. United States: SPIE, 2001(4367).: 41-51.
3Forgy E. Cluster analysis of multivariate data: Efficiency vs. interpretabillty of classifications[ M]. Biometrics, 1965, 21(3) : 768.
4MacQueen J. Some methods for classlfication and analysis of multivariate observations[ A]. Proceedinss of the Fifth Berkeley Symposium on Mathematical Statistics and Probability[ C]. Volume 1. Le-Cam LM, Neyman N, Ed. University of California Press, 1967.
5Duda RO, Hart PE. Pattern Classification and Scene Analysis[ M].New York: John Wiley and Sons, 1973.
6Selim SZ, Alsultan K. A Simulated Annealing Algorithm for the Clustering Problem[J]. Pattern Recognition, 1991, 24(10): 1003- 1008.
7Fayyad U, Reina C, Bradley PS. Initialization of Iterative Refinement Clustering Algorithms[ R]. Microsoft Research Technical Report MSR-TR-98-38, June 1998.
8Selim SZ, Ismail MA. K-Means-Type Algorithms: A Generalized Convergence Theorem and Charadterization of Local Optimality[ M].IEEE Trans Pattern Analysis and Machine Intelligence, 1984, PA-MI-6(1).
9Kaufman L, Rouseeuw P. Finding Groups in Data: An Introduction to Cluster Analysis[ M]. New York : John Wiley and Sons, 1990.
10Alsabti K, Ranks S, Singh V. An Efficient K-Means Clustering Algorithm[ A]. Proc. First Workshop on High-Performance Data Mining[C], 1997.
