An extended study of the K-means algorithm for data clustering and its applications

Journal of the Operational Research Society

Volumn 55, Issue 9, 2004, Pages 976-987

  Chen, Ja Shen ^a   Ching, Russell K H ^b   Lin, Yi Shen ^c  

^a YUAN ZE UNIVERSITY   (Taiwan)

^b CALIFORNIA STATE UNIVERSITY   (United States)

^c Chinatrust Commercial Bank ^*  (Taiwan)

Author keywords

Computational analysis; Data clustering; Heuristics; Marketing research

Indexed keywords

ALGORITHMS; DATA REDUCTION; HEURISTIC METHODS; INDUSTRIAL ECONOMICS; MANAGEMENT SCIENCE; MARKETING;

COMPUTATIONAL ANALYSIS; DATA CLUSTERING; MARKETING RESEARCH;

OPERATIONS RESEARCH;

EID: 4344675398     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601732     Document Type: Review

References (46)

1. Green PE (1971). A new approach to market segmentation. Business Horizons 20: 61-73.
2. Wind Y (1978). Issues and advances in segmentation research. J Marketing Res 15(3): 317-337.
3. Han J and Kamber M (2001). Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers: San Francisco, CA.
4. Murthy CA and Chowdhury N (1996). In search of optimal clusters using genetic algorithms. Pattern Recognition Lett 17: 825-832.
5. Al-Daoud MB and Roberts SA (1996). New methods for the initialization of clusters. Pattern Recognition Lett 17: 451-455.
6. Ralambondrainy H (1995). A conceptual version of the K-means algorithm. Pattern Recognition Lett 16: 1147-1157.
7. Huang Z (1998). Extensions to the K-means algorithm for clustering large datasets with categorical values. Data Min Knowl Disc 2(3): 283-304.
8. Green PE, Carmone Jr FJ and Kim J (1990). A preliminary study of optimal variable weighting in K-means clustering. J Classification 1: 271-285.
9. Paliwal KK and Ramasubramanian V (2000). Comments on algorithm for vector quantizer design. IEEE Trans Image Process 9(11): 1964-1967.
10. Carmone Jr FJ, Kara A and Maxwell S (1999). HINoV: a new model to improve market segment definition by identifying noisy variables. J Marketing Res 36(3): 501-509.
11. Garcia-Escudero LA and Gordaliza A (1999). Robustness properties of K Means and trimmed K Means. J Am Stat Assoc 94(447): 956-969.
12. Hruschka H and Natter M (1999). Comparing performance of feed-forward neural nets and K-means for cluster-based market segmentation. Ear J Opl Res 114(2): 346-353.
13. Lee H-S (1999). Automatic clustering of business processes in business systems Planning. Ear J Opl Res 114(2): 354-362.
14. Green PE and Krieger AM (1995). Alternative approaches to cluster-based market segmentation. J Marketing Res Soc 3: 221-239.
15. Milligan GW and Cooper MC (1985). An examination of procedures for determining the number of clusters in a dataset. Psychometrika 50(2): 159-179.
16. Balakrishnan PV, Cooper MC, Jacob VS and Lewis PA (1996). Comparative performance of the FSCL neural net and K-means algorithm for market segmentation. Eur J Opl Res 93(2): 346-357.
17. Cheng R and Milligan GW (1996). K-means clustering methods with influence detection. Edu Psvchol Measure 56(5): 833-838.
18. Krishna K and Murty MN (1999). Genetic K-means algorithm. IEEE Trans Syst Man Cybern Part B: Cybern 29(3): 433-439.
19. Milligan GW (1980). An examination of the effect of six types of error perturbation on fifteen clustering algorithm. Psychometrika 45: 325-342.
20. Pena JM, Lozano JA and Larranaga P (1999). An empirical comparison of four initialization methods for the K-means algorithm. Pattern Recognition Lett 20: 1027-1040.
21. Zheng GL and Billings SA (1999). An enhanced sequential fuzzy clustering algorithm. Int J Syst Sci 30(3): 295-307.
22. Bandyopadhyay S, Maulik U and Pakhira MK (2001). Clustering using simulated annealing with probabilistic redistribution. Int J Pattern Recognition Artif Intell 15(2): 269-285.
23. Park DC (2000). Centroid neural network for unsupervised competitive learning. IEEE Trans Neural Networks 11(2): 520-528.
24. Selim SZ and Ismail MA (1984). K-means type algorithms: a generalized convergence theorem and characterization of local optimality. IEEE Trans Pattern Anal Mach Intell 6(1): 81-87.
25. Birgin EG, Martinez JM and Ronconi DP (2003). Minimization subproblems and heuristics for an applied clustering problem. Eur J Opl Res 146: 19-34.
26. N. Info Sci 146: 221-237.
27. Kanungo T et al (2002). An efficient K-means clustering algorithm: Analysis and implementation. IEEE Trans Puttern Anal Mach Intell 24(7): 881-892.
28. Su M-C and Chou C-H (2001). A modified version of the K-means algorithm with a distance based on cluster symmetry. IEEE Trans Pattern Anal Mach Intell 23(6): 674-680.
29. Zhang R and Rudnicky AI (2002). A large scale clustering scheme for kernel K-means. Proceedings of 16th International Conference on Pattern Recognition, Quebec City, Canada. Volume 4, pp 289-292.
30. Kuo RJ, Ho LM and Hu CM (2002). Integration of self-organizing feature map and K-means algorithm for market segmentation. Comput Oper Res 29: 1475-1493.
31. Clausi (2002). K-means iterative fisher (KIF) unsupervised clustering algorithm applied to image texture segmentation. Pattern Recognition 35: 1959-1972.
32. Yeo AC, Smith KA, Willis RJ and Brooks M (2002). A mathematical programming approach to optimize insurance premium pricing with a data mining framework. J Opl Res Soc 53(11): 1197-1203.
33. Brusco MJ, Cradit JD and Stahl S (2002). A simulated annealing heuristic for a bicriterion partitioning problem in market segmentation. J Marketing Res 34: 99-109.
34. Forgy E (1965). Cluster analysis of multivariate data: efficiency vs. interpretability of classifications. Biometrics 21: 768.
35. MacQueen J (1967). Some methods for classification and analysis of multivariate observations. Proceedings of 5th Berkeley Symposium on Mathematics, Statistics and Probability, University of California, Berkeley, USA. Volume 1, pp 281-297.
36. Bentley J (1975). Multidimensional binary search trees used for associative searching. Comm ACM 18: 509-517.
37. Huth R (1996). An intercomparison of computer-assisted circulation classification methods. Int J Climatol 16: 893-922.
38. Punj G and Stewart DW (1983). Cluster analysis in marketing research: review and suggestions for application. J Marketing Res 20: 134-148.
39. Tou J and Gonzales R (1974). Pattern Recognition Principles. Addison-Wesley: Reading, MA.
40. Linde Y, Buzo A and Gary R (1980). An algorithm for vector quantizer design. IEEE Trans Commun 28(1): 84-95.
41. Anderberg MR (1973). Cluster Analysis for Applications. Academic Press: New York.
42. Kaufman L and Rousseeuw PJ (1990). Finding Groups in Data: An Introduction to Cluster Analysis. Wiley: Canada.
43. Katsavounidis I, Kuo C and Zhang Z (1994). A new initialization technique for generalized Lioyd iteration. IEEE Signal Process Lett 1(10): 144-146.
44. Fred A (2001). Finding consistent clusters in data partitions, In: Kittler J and Roli F (eds). MCS 2001, LNCS. volume 2096. pp 309-318. Springer-Verlag: Berlin, Heidelberg.
45. Dash M, Liu H and Xu X (2001). '1 + 1 < 2': merging distance and density based clustering. Proceedings of the Seventh International Conference on Database Systems for Advanced Applications, Hong Kong, China, pp 32-39.
46. Chung HM and Gary P (1999). Special section: data mining. J Manage Inf Syst 16(1): 11-16.