K-means clustering: A half-century synthesis

British Journal of Mathematical and Statistical Psychology

Volumn 59, Issue 1, 2006, Pages 1-34

  Steinley, Douglas ^a  

^a UNIVERSITY OF MISSOURI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; CLUSTER ANALYSIS; METHODOLOGY; PSYCHOLOGY; STATISTICAL ANALYSIS; STATISTICS;

ALGORITHMS; CLUSTER ANALYSIS; DATA INTERPRETATION, STATISTICAL; PSYCHOLOGY;

EID: 33745223877     PISSN: 00071102     EISSN: None     Source Type: Journal    
DOI: 10.1348/000711005X48266     Document Type: Article

References (214)

1. Akaike, H. (1974). A new look at the statistical model identification. IEEE Transactions on Automatic Control, 19, 716-723.
2. Anderberg, M. R. (1973). Cluster analysis for applications. New York: Academic Press.
3. Anderson, T. W (1958). An introduction to multivariate statistical analysis. New York: Wiley.
4. Arabie, P., & Hubert, L. (1992). Combinatorial data analysis. Annual Review of Psychology, 43, 169-203.
5. Arabie, P., & Hubert, L. (1994). Cluster analysis in marketing research. In R. P. Bagozzi (Ed.), Advanced methods of marketing research (pp. 160-189). Oxford: Blackwell.
6. Art, D., Gnanadesikan, R., & Kettenring, J. R. (1982). Data-based metrics for cluster analysis. Utilitas Mathematica, 21A, 75-99.
7. Astrahan, M. M. (1970). Speech analysis by clustering, or the hyperphome method. Stanford Artificial Intelligence Project Memorandum AIM-124. Stanford, CA: Stanford University.
8. Bajgier, S. M., & Aggarwal, L. K. (1991). Powers of goodness-of-fit tests in detecting balanced mixed normal distributions. Educational and Psychological Measurement, 51, 253-269.
9. Ball, G. H., & Hall, D. J. (1965). ISODATA: A novel method for data analysis and pattern classification. Menlo Park, CA: Stanford Research Institute.
10. Ball, G. H., & Hall, D. J. (1967). PROMENADE - an on-line pattern recognition system. Research Report RADC-TR-67-310. Menlo Park, CA: Stanford Research Institute.
11. Banfield, C. F., & Bassill, L. C. (1977). Algorithm AS 113. A transfer algorithm for non-hierarchical classification. Applied Statistics, 26, 206-210.
12. Banfield, J. D., & Raftery, A. E. (1993). Model-based Gaussian and non-Gaussian clustering. Biometrics, 49, 803-821.
13. Barker, D. (1976). Hierarchic and non-hierarchic grouping methods: An empirical comparisons of two techniques. Geografiska Annaler, 5, 42-58.
14. Barnett, V., & Lewis, T. (1994). Outliers in statistical data (3rd ed.). New York: Wiley.
15. Bartholomew, D. J., & Knott, M. (1999). Latent variable models and factor analysis. London: Arnold.
16. Bartko, J. J., Strauss, J. S., & Carpenter, W. T., Jr. (1971). An evaluation of taxometric techniques for psychiatric data. Classification Society Bulletin, 2, 2-28.
17. Bayne, C. K., Beauchamp, J. J., Begovich, C. L., & Kane, V. E. (1980). Monte Carlo comparisons of selected clustering procedures. Pattern Recognition, 12, 51-62.
18. Belbin, L. (1987). The use of non-hierarchical allocation methods for clustering large sets of data. Australian Computer Journal, 19, 32-41.
19. Ben-Hur, A., Horn, D., Siegelmann, H. T., & Vapnik, V. (2001). Support vector clustering. Journal of Machine Learning Research, 2, 125-137.
20. Bezdek, J. C. (1974). Cluster validity with fuzzy sets. Journal of Cybernetics, 3, 58-73.
21. Bezdek, J. C. (1980). A convergence theorem for the fuzzy ISODATA clustering algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2, 1-8.
22. Bischof, H., Leonards, A., & Selb, A. (1999). MDL principle for robust vector quantisation. Pattern Analysis and Applications, 2, 59-72.
23. Blashfield, R. (1977). The equivalence of three statistical packages for performing hierarchical cluster analysis. Psychometrika, 42, 429-431.
24. Blashfield, R. K., Aldenderfer, M. S., & Morey, L. C. (1982). Validating a cluster analytic solution. In H. Hudson (Ed.), Classifying social data (pp. 167-176). San Francisco: Jossey-Bass.
25. Bock, H. H. (1985). On some significance tests in cluster analysis. Journal of Classification, 2, 77-108.
26. Bock, H. H. (1996). Probability models and hypothesis testing in partitioning cluster analysis. In P. Arabic, L. J. Hubert, & G. De Soete (Eds.), Clustering and classification (pp. 377-453). River Edge, NJ: World Scientific.
27. Borg, I., & Groenen, P. (1997). Modern multidimensional scaling: Theory and applications. New York: Springer.
28. Bradley, P. S., & Fayyad, U. M. (1998). Refining initial points for k-means clustering. In J. Shavlik (Ed.), Machine learning: Proceedings of the fifteenth International Conference (pp. 91-99). San Francisco: Morgan Kaufmann.
29. Brusco, M. J. (2004). Clustering binary data in the presence of masking variables. Psychological Methods, 9, 510-523.
30. Brusco, M. J., & Cradit, J. D. (2001). A variable-selection heuristic for K-means clustering. Psychometrika, 66, 249-270.
31. Calinski, R. B., & Harabasz, J. (1974). A dendrite method for cluster analysis. Communications in Statistics, 3, 1-27.
32. Carmignani, M., Genco, A., Lombardo, A., & Tortorici, A. (1988). Quadratic and linear systolic solutions for cluster analysis. In E. Diday (Ed.), Data analysis and informatics V (pp. 373-380). Amsterdam: North-Holland.
33. Carmone, F. J., Kara, A., & Maxwell, S. (1999). HINoV: A new model to improve market segment definition by identifying noisy variables. Journal of Marketing Research, 36, 501-509.
34. Carroll, J. D., & Chaturvedi, A. (1995). A general approach to clustering and multidimensional scaling of two-way, three-way, or higher-way data. In R. D. Luce, M. D'Zmura, D. Hoffman, et al. (Eds.), Geometric representations of perceptual phenomena (pp. 295-318). Mahwah, NJ: Erlbaum.
35. Carroll, J. D., & Chaturvedi, A. (1998). K-midranges clustering. In A. Rizzi, M. Vichi, & H. H. Bock (Eds.), Advances in data science and classification (pp. 3-14). Berlin: Springer.
36. Carroll, J. D., Green, P. E., & Schaffer, C. M. (1986). Interpoint distance comparisons in correspondence analysis. Journal of Marketing Research, 22, 271-281.
37. Celeux, G., & Soromenho, G. (1996). An entropy criterion for assessing the number of clusters in a mixture model. Journal of Classification, 13, 195-212.
38. Cerioli, A. (1998). A new method for detecting influential observations in nonhierarchical cluster analysis. In A. Rizzi, M. Vichi, & H. H. Bock (Eds.), Advances in data science and classification (pp. 15-20). Berlin: Springer.
39. Cerioli, A., & Zani, S. (2001). Exploratory methods for detecting high density regions in cluster analysis. In S. Borra, R. Rocci, M. Vichi & M. Schader (Eds.), Advances in classification and data analysis (pp. 11-18). Berlin: Springer.
40. Chang, W. C. (1983). On using principal components before separating a mixture of two multivariate normal distributions. Applied Statistics, 32, 267-275.
41. Chaturvedi, A. D., Carroll, J. D., Green, P., & Rotondo, J. A. (1997). A feature based approach to market segmentation via overlapping K-centroids clustering. Journal of Marketing Research, 34, 370-377.
42. Chaturvedi, A. D., Green, P. E., & Carroll, J. D. (2001). K-modes clustering. Journal of Classification, 18, 35-55.
43. Cheng, R., & Milligan, G. W. (1996a). K-means clustering methods with influence detection. Educational and Psychological Measurement, 56, 833-838.
44. Cheng, R., & Milligan, G. W. (1996b). Measuring the influence of individual data points in cluster analysis. Journal of Classification, 13, 315-335.
45. Cooper, L. (1973). M-dimensional location models: Application to cluster analysis. Journal of Regional Science, 13, 41-54.
46. Cormack, R. M. (1971). A review of classification. Journal of the Royal Statistical Society A, 134, 321-367.
47. Cox, D. R. (1957). Note on grouping. Journal of the American Statistical Association, 52, 543-547.
48. Cuesta-Albertos, J. A., Gordaliza, A., & Matran, C. (1997). Trimmed K-means: An attempt to robustify quantizers. Annals of Statistics, 25, 553-576.
49. Davidson, I. (2002). Understanding K-means non-hierarchical clustering (Tech. Rep. 02-2). Albany: State University of New York.
50. Davies, D. L., & Bouldin, D. W. (1979). A cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1, 224-227.
51. Day, N. E. (1969). Estimating the components of a mixture of normal distributions. Biometrika, 56, 463-474.
52. De Backer, S., & Scheunders, P. (1999). A competitive elliptical clustering algorithm. Pattern Recognition Letters, 20, 1141-1147.
53. De Soete, G. (1986). Optimal variable weighting for ultrametric and additive tree clustering. Quality and Quantity, 20, 169-180.
54. De Soete, G. (1988). OVWTRE: A program for optimal variable weighting for ultrametric and additive tree fitting. Journal of Classification, 5, 101-104.
55. De Soete, G., & Carroll, J. D. (1994). K-means clustering in a low-dimensional Euclidean space. In E. Diday, Y. Lechevallier, M. Schader, et al. (Eds.), New approaches in classification and data analysis (pp. 212-219). Berlin: Springer.
56. Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the E-M algorithm. Journal of the Royal Statistical Society B, 39, 1-38.
57. DeSarbo, W. S., Carroll, J. D., Clark, L. A., & Green, P. E. (1984). Synthesized clustering: A method for amalgamating alternative clustering bases with differential weighting of variables. Psychometrika, 49, 57-78.
58. DeSarbo, W. S., & Mahajan, V. (1984). Constrained classification: The use of a priori information in cluster analysis. Psychometrika, 49, 187-215.
59. Dick, N. P., & Bowden, D. C. (1973). Maximum likelihood estimation for mixtures of two normal distributions. Biometrics, 29, 781-790.
60. Diehr, G. (1973, April). Minimum variance partitions and mathematical programming. Paper presented at the National Meetings of The Classification Society, Atlanta, Georgia.
61. Dillon, W. R., Mulani, N., & Frederick, D. G. (1989). On the use of component scores in the presence of group structure. Journal of Consumer Research, 16, 106-112.
62. Dimitriadou, E., Dolničar, S., & Weingessel, A. (2002). An examination of indices for determining the number of clusters in binary data sets. Psychometrika, 67, 137-160.
63. Dodge, Y., & Gafner, T. (1994). Complexity relaxation of dynamic programming for cluster analysis. In E. Diday, Y. Lechevallier, M. Schader, et al. (Eds.), New approaches in classification and data analysis (pp. 220-227). Berlin: Springer.
64. Donoghue, J. R. (1995). Univariate screening measures for cluster analysis. Multivariate Behavioral Research, 30, 385-427.
65. Dubes, R., & Jain, A. K. (1976). Clustering techniques: The user's dilemma. Pattern Recognition, 8, 247-260.
66. Duda, R. O., Hart, P. E., & Stork, D. G. (2001). Pattern recognition (2nd ed.). New York: Wiley.
67. Dunn, J. C. (1974). A fuzzy relative of the ISODATA process and its use in detecting compact well separated clusters. Journal of Cybernetics, 3, 32-57.
68. Edwards, A. W. F., & Cavalli-Sforza, L. L. (1965). A method for cluster analysis. Biometrics, 21, 362-375.
69. Elias, P. (1970). Bounds on the performance of optimum quantizers. IEEE Transactions on Information Theory, 16, 172-184.
70. Engelman, L., & Hartigan, J. A. (1969). Percentage points of a test of clusters. Journal of the American Statistical Association, 64, 1647-1648.
71. Everitt, B. S. (1977). Cluster analysis. In C. A. O'Muircheartaigh & C. Payne (Eds.), Exploring data structures (Vol. 1, pp. 63-88). New York: Wiley.
72. Everitt, B. S. (1979). Unresolved problems in cluster analysis. Biometrics, 35, 169-181.
73. Everitt, B. S., Gourlay, A. J., & Kendall, R. E. (1971). An attempt at validation of traditional psychiatric syndromes by cluster analysis. British Journal of Psychiatry, 119, 399-412.
74. Faber, V. (1994). Clustering and the continuous K-means algorithm. Los Alamos Science, 22, 138-144.
75. Falkenauer, E., & Marchand, A. (2001, June). Using K-Means? Consider ArrayMiner. Paper presented at the 2001 International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences, Las Vegas, Nevada.
76. Fisher, L., & Van Ness, J. W. (1971). Admissible clustering procedures. Biometrika, 58, 91-104.
77. Fisher, W. D. (1958). On grouping for maximum homogeneity. Journal of the American Statistical Association, 53, 789-798.
78. Fletcher, J. M., & Satz, P. (1985). Cluster analysis and the search for learning disabilities subtypes. In B. P. Rourke (Ed.), Neuropsychology of learning disabilities: Essentials of subtypes analysis (pp. 40-64). New York: Guilford.
79. Flury, B. A. (1990). Principal points. Biometrika, 77, 33-41.
80. Forgy, E. W. (1965). Cluster analysis of multivariate data: Efficiency versus interpretability of classifications. Biometrics, 21, 768-769.
81. Fowlkes, E. B., Gnanadesikan, R., & Kettenring, J. R. (1988). Variable selection in clustering. Journal of Classification, 5, 205-228.
82. Fraley, C., & Raftery, A. E. (2002). Model-based clustering, discriminant analysis, and density estimation. Journal of the American Statistical Association, 97, 611-631.
83. Friedman, H. P., & Rubin, J. (1967). On some invariant criteria for grouping data. Journal of the American Statistical Association, 62, 1159-1178.
84. Friedman, J. H. (1987). Exploratory projection pursuit. Journal of the American Statistical Association, 82, 249-266.
85. Gaenssler, P. (1988). On a modification of the K-means clustering procedure. In E. Diday (Ed.), Data analysis and informatics V (pp. 365-371). Amsterdam: North-Holland.
86. Garcia-Escudero, L. A., & Gordaliza, A. (1999). Robustness of properties of K-means and trimmed K-means. Journal of the American Statistical Association, 94, 956-969.
87. Garcia-Escudero, L. A., Gordaliza, A., & Matran, C. (1999a). Asymptotics for trimmed K-means and associated tolerance zones. Journal of Statistical Planning and Inference, 77, 247-262.
88. Garcia-Escudero, L. A., Gordaliza, A., & Matran, C. (1999b). A central limit theorem for multivariate generalized trimmed K-means. Annals of Statistics, 27, 1061-1079.
89. Gentle, J. E. (2002). Elements of computational statistics. New York: Springer.
90. Gersho, A., & Gray, R. M. (1992). Vector quantization and signal compression. Boston: Kluwer Academic.
91. Gierl, H., & Schwanenberg, S. (1998). A comparison of traditional segmentation methods with segmentation based upon artificial neural networks by means of conjoint data from a Monte Carlo simulation. In I. Balderjahn, R. Mathar, & M. Schader (Eds.), Classification, data analysis, and data highways (pp. 386-392). Berlin: Springer.
92. Gitman, I., & Levine, M. D. (1970). An algorithm for detecting unimodal fuzzy sets and its application as a clustering technique. IEEE Transactions on Computers, 19, 583-593.
93. Gnanadesikan, R., Harvey, J. W., & Kettenring, J. R. (1993). Mahalanobis metrics for cluster analysis. Sankhyā A, 55, 494-505.
94. Gnanadesikan, R., Kettenring, J. R., & Tsao, S. L. (1995). Weighting and selection of variables for cluster analysis. Journal of Classification, 12, 113-136.
95. Gordon, A. D. (1973). Classification in the presence of constraints. Biometrics, 29, 821-827.
96. Gordon, A. D. (1999). Classification (2nd ed.). Boca Raton, FL: Chapman & Hall/CRC.
97. Gordon, A. D., & Henderson, J. J. (1977). An algorithm for Euclidean sum of squares classification. Biometrics, 33, 355-362.
98. Gordon, G., & Moore, A. (2000). Learning filaments. In P. Langley (Ed.), Proceedings of the seventeenth International Conference on Machine Learning (pp. 335-342). San Franscisco: Morgan Kaufman.
99. Gower, J. C. (1975). Generalized Procrustes analysis. Psychometrika, 40, 33-51.
100. Green, P. E., Carmone, F J., & Kim, J. (1990). A preliminary study of optimal variable weighting in K-means clustering. Journal of Classification, 7, 271-285.
101. Green, P. E., & Krieger, A. M. (1995). Alternative approaches to cluster-based market segmentation. Journal of the Market Research Society, 37, 221-239.
102. Hajnal, I., & Loosveldt, G. (2000). The effects of initial values and the covariance structure on the recovery of some clustering methods. In H. A. L. Kiers, J. -P. Rasson, P. J. F. Groenen, & M. Schader (Eds.), Data analysis, classification, and related methods (pp. 47-52). Berlin: Springer.
103. Hamerly, G., & Elkan, C. (2002). Learning the K in K-means (Tech. Rep. CS2002-0716). La Jolla, CA: University of California at San Diego.
104. Hansen, P., Jaumard, B., & Mladenovic, N. (1998). Minimum sum of squares clustering in a low dimensional space. Journal of Classification, 15, 37-55.
105. Hartigan, J. A. (1975). Clustering algorithms. New York: Wiley.
106. Hartigan, J. A. (1978). Asymptotic distributions for clustering criteria. Annals of Statistics, 6, 117-131.
107. Hartigan, J. A. (1985). Statistical theory in clustering. Journal of Classification, 2, 63-76.
108. Hartigan, J. A., & Wong, M. A. (1979). Algorithm AS 136: A k-means clustering algorithm. Applied Statistics, 28, 100-108.
109. Hastie, T., Tibshirani, R., & Friedman, J. (2001). The elements of statistical learning: Data mining, inference, and prediction. New York: Springer.
110. Huang, Z. (1998). Extensions to the K-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery, 2, 283-304.
111. Huang, Z., & Ng, M. K. (2003). A note on K-modes clustering. Journal of Classification, 20, 257-261.
112. Heiser, W. J., & Groenen, P. J. F. (1997). Cluster differences scaling with a within-clusters loss component and a fuzzy successive approximation strategy to avoid local minima. Psychometrika, 62, 63-83.
113. Huber, P. J. (1981). Robust statistics. New York: Wiley.
114. Hubert, L. J. (2002, June). John van Ryzin's life and work. Invited talk presented at the North American Classification Society, Madison, WI.
115. Hubert, L. J., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2, 193-218.
116. Hubert, L. J., Arabie, P., & Meulman, J. (2001). Combinatorial data analysis: Optimization by dynamic programming. Philadelphia: SIAM.
117. Hubert, L. J., & Levin, J. R. (1976). A general statistical framework for assessing categorical clustering in free recall. Psychological Bulletin, 83, 1072-1080.
118. Huberty, C. J., DiStefano, C., & Kamphaus, R. W. (1997). Behavioral clustering of school children. Multivariate Behavioral Research, 32, 105-134.
119. Jain, A. K., & Moreau, J. V. (1987). Bootstrap technique in cluster analysis. Pattern Recognition, 20, 547-568.
120. Jensen, R. E. (1969). A dynamic programming algorithm for cluster analysis. Operations Research, 17, 1034-1057.
121. Jhun, M., & Jin, S. (2000). On a modified K-spatial medians clustering. Journal of the Korean Statistical Society, 29, 247-260.
122. Johnson, R. A., & Wichern, D. W. (2002). Applied multivariate statistical analysis (5th ed.). Upper Saddle River, NJ: Prentice Hall.
123. Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002). An efficient K-means clustering algorithm: analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 881-892.
124. 1 - norm and related methods (pp.405-416). Amsterdam: Elsevier.
125. Kaufman, L., & Rousseeuw, P. (1990). Finding groups in data: An introduction to cluster analysis. New York: Wiley.
126. Kass, R. E., & Wasserman, L. (1995). A reference Bayesian test for nested hypotheses and its relationship to the Schwarz criterion. Journal of the American Statistical Association, 90, 928-934.
127. Kiers, H. A. L. (1997). Discrimination by means of components that are orthogonal in the data space. Journal of Chemometrics, 11, 533-545.
128. Körkel, M. (1986). Clustering algorithms for the within-class scatter criterion with a restricte d number of elements per cluster. In W. Gaul & M. Schader (Eds.), Classification as a tool for research (pp. 241-247). Amsterdam: North-Holland.
129. Krzanowski, W. J., & Lai, Y. T. (1988). A criterion for determining the number of groups in a data set using sum-of-squares clustering. Biometrics, 44, 23-34.
130. Krzanowski, W. J., & Marriott, F. H. C. (1995). Multivariate analysis II: Classification, covariance structures and repeated measures. London: Arnold.
131. Lattin, J., Carroll, J. D., & Green, P. E. (2003). Analyzing multivariate data. Pacific Grove, CA: Brooks/Cole.
132. Likas, A., Vlassis, N., & Verbeek, J. (2003). The global K-means clustering algorithm. Pattern Recognition, 36, 451-461.
133. MacQueen, J. (1967). Some methods of classification and analysis of multivariate observations. In L. M. Le Cam & J. Neyman (Eds.), Proceedings of the fifth Berkeley symposium on mathematical statistics and probability (Vol. 1, pp. 281-297). Berkeley, CA: University of California Press.
134. Maitra, R. (2001). Clustering massive datasets with applications in software metrics and tomography. Technometrics, 43, 336-346.
135. Makarenkov, V., & Legendre, P. (2001). Optimal variable weighting for ultrametric and additive trees and K-means partitioning: Methods and software. Journal of Classification, 18, 245-271.
136. Mardia, K. V. (1970). Measures of multivariate skewness and kurtosis with applications. Biometrika, 57, 519-530.
137. Mardia, K. V. (1974). Applications of some measures of multivariate skewness and kurtosis for testing normality and robustness studies. Sankhyā B, 36, 115-128.
138. 2 test. Applied Statistics, 24, 163-171.
139. Mardia, K. V., Kent, J. T., & Bibby, J. M. (1979). Multivariate analysis. New York: Academic Press.
140. Maronna, R., & Jacovkis, P. M. (1974). Multivariate clustering procedures with variable metrics. Biometrics, 30, 499-505.
141. Marriott, F. H. C. (1971). Practical problems in a method of cluster analysis. Biometrics, 27, 501-514.
142. Massart, D. L., Plastria, F., & Kaufman, L. (1983). Non-hierarchical clustering with MASLOC. Pattern Recognition, 16, 507-516.
143. McLachlan, G. J., & Basford, K. E. (1988). Mixture models: Inference and applications to clustering. New York: Marcel Dekker.
144. McLachlan, G. J., & Peel, D. (2000). Finite mixture models. New York: Wiley.
145. McRae, D. J. (1971). MIKCA: A FORTRAN IV iterative K-means cluster analysis program. Behavioral Science, 16, 423-424.
146. Mezzich, J. E. (1978). Evaluating clustering methods for psychiatric diagnosis. Biological Psychiatry, 13, 265-281.
147. Milligan, G. W. (1980). An examination of the effect of six types of error perturbation on fifteen clustering algorithms. Psychometrika, 45, 325-342.
148. Milligan, G. W. (1981). A Monte Carlo study of thirty internal criterion measures for cluster analysis. Psychometrika, 46, 187-199.
149. Milligan, G. W. (1985). An algorithm for generating artificial test clusters. Psychometrika, 50, 123-127.
150. Milligan, G. W. (1996). Clustering validation: Results and implications for applied analysis. In R Arabie, L. J. Hubert, & G. De Soete (Eds.), Clustering and classification (pp. 341-375). River Edge, NJ: World Scientific.
151. Milligan, G. W., & Cooper, M. C. (1985). An examination of procedures for determining the number of clusters in a data set. Psychometrika, 50, 159-179.
152. Milligan, G. W., & Cooper, M. C. (1987). Methodological review: Clustering methods. Applied Psychological Measurement, 11, 329-354.
153. Milligan, G. W, & Cooper, M. C. (1988). A study of standardization of variables in cluster analysis. Journal of Classification, 5, 181-204.
154. Milligan, G. W., & Sokol, L. M. (1980). A two-stage clustering algorithm with robust recovery characteristics. Educational and Psychological Measurement, 40, 755-759.
155. Mirkin, B. G. (1990). A sequential fitting procedure for linear data analysis models. Journal of Classification, 7, 167-195.
156. Mirkin, B. G. (1996). Mathematical classification and clustering. Dordrecht: Kluwer.
157. Mirkin, B. G. (1998). Mathematical classification and clustering: From how to what and why. In I. Balderjahn, R. Mathar, & M. Schader (Eds.), Classification, data analysis, and data highways (pp. 172-181). Berlin: Springer.
158. Mizuta, M. (1998). Two principal points of symmetric distributions. In A. Rizzi, M. Vichi, & H. H. Bock (Eds.), Advances in data science and classification (pp. 171-176). Berlin: Springer-Verlag.
159. Morrison, D. F. (1976). Multivariate statistical methods (2nd ed). New York: McGraw-Hill.
160. Ng, R. T., & Man, J. (1994). Efficient and effective clustering methods for spatial data mining. In J. Bocca, M. Jarke, & C. Zaniolo (Eds.), Proceedings of the 20th international conference on very large databases (pp. 144-155). San Francisco, CA: Morgan Kaufmann.
161. Pelleg, D., & Moore. A. (1999). Accelerating exact K-means algorithms with geometric reasoning. In S. Chaudhuri & D. Madigan (Eds.), Proceedings of the fifth international conference on knowledge discovery in databases (pp. 277-281). Menlo Park, CA: AAAI Press.
162. Pelleg, D., & Moore, A. (2000). X-means: Extending K-means with efficient estimation of the number of clusters. In Proceedings of the seventeenth international conference on machine learning (pp. 727-734). San Francisco: Morgan Kaufmann.
163. Pollard, D. (1981). Strong consistency of K-means clustering. Annals of Statistics, 9, 135-140.
164. Pollard, D. (1982). A central limit theorem for K-means clustering. Annals of Probability, 10, 919-926.
165. Press, W. H., Flannery, B. P, Teukolsky, S. A., & Vetterling, W. T. (1986). Numerical recipes, the art of scientific computing. Cambridge: Cambridge University Press.
166. Punj, G., & Stewart, D. W. (1983). Cluster analysis in marketing research: Review and suggestions for application. Journal of Marketing Research, 20, 134-148.
167. Rao, C. R. (1948). The utilization of multiple measurements in problems of biological classification. Journal of the Royal Statistical Association B, 10, 159-193.
168. Rao, M. R. (1971). Cluster analysis and mathematical programming. Journal of the American Statistical Association, 66, 622-626.
169. Ray, S., & Turi, R. H. (2000). Determination of the number of clusters in K-means clustering and application in colour image segmentation. In N. R. Pal, A. K. De & J. Das (Eds.), Proceedings of the 4th International Conference on Advances in Pattern Recognition and Digital Techniques (pp. 137-143). New Delhi: Narosa.
170. SAS. (2004). The FASTCLUS procedure. In SAS/STAT 9.1 user's guide, Volume 2. Cary, NC: SAS Institute.
171. Schaffer, C. M., & Green, P. E. (1996). An empirical comparison of variable standardization methods in cluster analysis. Multivariate Behavioral Research, 31, 149-167.
172. Schaffer, C. M., & Green, P. E. (1998). Cluster-based market segmentation: Some further comparisons of alternative approaches. Journal of the Market Research Society, 40, 155-163.
173. Schwarz, G. (1978). Estimating the dimension of a model. Annals of Statistics, 6, 461-464.
174. Scott, A. J., & Symons, M. J. (1971). Clustering methods based on likelihood ratio criteria. Biometrics, 27, 387-398.
175. Sebestyen, G. S. (1962). Decision making processes in pattern recognition. New York: Macmillan.
176. Selim, S. Z., & Ismail, M. A. (1984). K-means type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 81-87.
177. Sneath, P. H. A. (1957). The application of computers in taxonomy. Journal of General Microbiology, 17, 201-226.
178. Späth, H. (1980). Cluster analysis algorithms for data reduction and classification of objects. New York: Wiley.
179. Späth, H. (1985). Cluster dissection and analysis: Theory, FORTRAN programs, examples. New York: Wiley.
180. Späth, H. (1986a). Anti-clustering: Maximizing the variance criterion. Control and Cybernetics, 15, 213-218.
181. Späth, H. (1986b). Maximizing partitioning cluster criteria for quantitative data. Studien zur Klassifikation, 17, 221-228.
182. SPSS (2003). SPSS 12.0 command syntax reference. Chicago: SPSS.
183. Steinley, D. (2003). K-means clustering: What you don't know may hurt you. Psychological Methods, 8, 294-304.
184. Steinley, D. (2004a). Standardizing variables in K-means clustering. In D. Banks, L. House, F. R. McMorris, P. Arabie, & W. Gaul (Eds.), Classification, clustering, and data mining applications (pp. 53-60). New York: Springer.
185. Steinley, D. (2004b). Properties of the Hubert-Arabie adjusted Rand index. Psychological Methods, 9, 386-396.
186. Stoddard, A. M. (1979). Standardization of measures prior to cluster analysis. Biometrics, 35, 765-773.
187. Stute, W., & Zhu, L. X. (1995). Asymptotics of K-means clustering based on projection pursuit. Sankhyā, 57, 462-471.
188. Su, M.-C., & Chou, C.-H. (2001). A modified version of the K-means algorithm with a distance based on cluster symmetry. Paper presented at the IEEE Conference on Computing.
189. Symons, M. J. (1981). Clustering criteria and multivariate normal mixtures. Biometrics, 37, 35-43.
190. Tarpey, T, Li, L., & Flury, B. D. (1995). Principal points and self-consistent points of elliptical distributions. Annals of Statistics, 23, 103-112.
191. Thorndike, R. L. (1953). Who belongs in the family? Psychometrika, 18, 267-276.
192. Tibshirani, R., Walther, G., & Hastie, T. (2001). Estimating the number of cluters in a data set via the gap statistic. Journal of the Royal Statistical Society B, 63, 411-423.
193. Timm, N. H. (2002). Applied multivariate analysis. New York: Springer.
194. Van Buuren, J., & Heiser, W. J. (1989). Clustering N objects into K groups under optimal scaling of variables. Psychometrika, 54, 699-706.
195. Van Ness, J. W. (1973). Admissible clustering procedures II. Biometrika, 60, 422-424.
196. van Os, B. J. (2000). Dynamic programming for partitioning in multivariate data analysis. Leiden: Leiden University Press.
197. Vesanto, J. (2001). Importance of individual variables in the k-means algorithm. In D. Cheung, G. J. Williams, & Q. Li (Eds.), Proceedings of the Pacific-Asia conference in knowledge discovery and data mining (pp. 513-518). Berlin: Springer.
198. Vichi, M., & Kiers, H. A. L. (2001). Factorial K-means analysis for two-way data. Computational Statistics and Data Analysis, 37, 49-64.
199. Vinod, H. D. (1969). Integer programming and the theory of groups. Journal of the American Statistical Association, 64, 506-519.
200. Wagstaff, K., Cardie, C., Rogers, S., & Schroedl, S. (2001). Constrained K-means clustering with background knowledge. In Proceedings of the eighteenth international conference on machine learning (pp. 577-584). San Francisco, CA: Morgan Kaufmann.
201. Waller, N. G., Kaiser, H. A., Illian, J. B., & Manry, M. (1998). A comparison of the classification capabilities of the 1-dimensional Kohonen neural network with two partitioning and three hierarchical cluster analysis algorithms. Psychometrika, 63, 5-22.
202. Ward, J. H. (1963). Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58, 236-244.
203. Weisstein, E. W. (2003). CRC concise encyclopedia of mathematics. Boca Raton, FL: Chapman & Hall/CRC.
204. Windham, M. P. (1987). Parameter modification for clustering criteria. Journal of Classification, 4, 191-214.
205. Wishart, D. (1969). FORTRAN II programs for 8 methods of cluster analysis (CLUSTAN 1). Computing Contributions, 38th State Geological Survey. Lawrence, KS: University of Kansas.
206. Wolfe, J. H. (1970). Pattern clustering by multivariate mixture analysis. Multivariate Behavioral Research. 5, 329-350.
207. Wong, M. A. (1982a). Asymptotic properties of univariate population K-means clusters. Classification Society Bulletin, 5, 44-50.
208. Wong, M. A. (1982b). A hybrid clustering algorithm for identifying high density clusters. Journal of the American Statistical Association, 77, 841-847.
209. Wong, M. A. (1984). Asymptotic properties of univariate sample K-means clusters. Journal of Classification, 1, 255-270.
210. Wong, M. A. (1985). A bootstrap testing procedure for investigating the number of subpopulations. Journal of Statistical Computation and Simulation, 22, 99-112.
211. Wong, M. A., & Lane, T. (1983). kth nearest neighbor clustering procedure. Journal of the Royal Statistical Society B, 45, 362-368.
212. Zadeh, L. A. (1965). Fuzzy sets. Information and Control, 8, 338-353.
213. Zhang, B. (2000). Generalized K-harmonic means - boosting in unsupervised learning. Hewlett Packard Technical Report, HPL-2000-137.
214. Zhang, B., Hsu, M., & Dayal, U. (1999). K-harmonic means - a data clustering algorithm (Hewlett Packard Technical Report, HPL-1999-124). Palo Alto, CA: Hewlett Packard Laboratories.