An Efficient Global K-means Clustering Algorithm

@article{Xie2011AnEG,
  title={An Efficient Global K-means Clustering Algorithm},
  author={Juanying Xie and Shuai Jiang and Weixin Xie and Xinbo Gao},
  journal={JCP},
  year={2011},
  volume={6},
  pages={271-279}
}
K-means clustering is a popular clustering algorithm based on the partition of data. However, K-means clustering algorithm suffers from some shortcomings, such as its requiring a user to give out the number of clusters at first, and its sensitiveness to initial conditions, and its being easily trapped into a local solution et cetera. The global Kmeans algorithm proposed by Likas et al is an incremental approach to clustering that dynamically adds one cluster center at a time through a… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS