Journal
SPRINGERPLUS
Volume 5, Issue -, Pages -Publisher
SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1186/s40064-016-3329-4
Keywords
k-Means; Clustering; MinMax k-means; Global k-means
Categories
Funding
- National Natural Science Foundation of China [61275120, 61203228, 61573016]
Ask authors/readers for more resources
The global k-means algorithm is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure from suitable initial positions, and employs k-means to minimize the sum of the intra-cluster variances. However the global k-means algorithm sometimes results singleton clusters and the initial positions sometimes are bad, after a bad initialization, poor local optimal can be easily obtained by k-means algorithm. In this paper, we modified the global k-means algorithm to eliminate the singleton clusters at first, and then we apply MinMax k-means clustering error method to global k-means algorithm to overcome the effect of bad initialization, proposed the global Minmax k-means algorithm. The proposed clustering method is tested on some popular data sets and compared to the k-means algorithm, the global k-means algorithm and the MinMax k-means algorithm. The experiment results show our proposed algorithm outperforms other algorithms mentioned in the paper.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available