Journal of the Operational Research Society · 2004 · 30 citations · 43 references
ComputingComputer ScienceData ScienceData MiningMachine LearningStatistical ComputingCluster DetectionCluster VisualizationClustered Data AnalysisDimensionality ReductionDocument ClusteringPrincipal Component AnalysisCluster AnalysisClusteringClustering AnalysisHigh-dimensional Data ClusteringK-means Clustering
The K-means algorithm has been a widely applied clustering technique, especially in the area of marketing research. In spite of its popularity and ability to deal with large volumes of data quickly and efficiently, K-means has its drawbacks, such as its inability to provide good solution quality and robustness. In this paper, an extended study of the K-means algorithm is carried out. We propose a new clustering algorithm that integrates the concepts of hierarchical approaches and the K-means algorithm to yield improved performance in terms of solution quality and robustness. This proposed algorithm and score function are introduced and thoroughly discussed. Comparison studies with the K-means algorithm and three popular K-means initialization methods using five well-known test data sets are also presented. Finally, a business application involving segmenting credit card users demonstrates the algorithm's capability.
43
Data mining: concepts and techniques
Jiawei Han, Micheline Kamber · Choice Reviews Online · 2012 · 28.9K citations
Finding groups in data: an introduction to cluster analysis
Choice Reviews Online · 1991 · 10.6K citations
Multidimensional binary search trees used for associative searching
Jon Bentley · Communications of the ACM · 1975 · 7.5K citations · Full text
An Algorithm for Vector Quantizer Design
Y. Linde, A. Buzo, Robert M. Gray · IEEE Transactions on Communications · 1980 · 7.2K citations