Modified global k-means algorithm for minimum sum-of-squares clustering problems

PATTERN RECOGNITION

卷:41

Article

Bagirov, Adil M.

关键词: minimum sum-of-squares clustering;    nonsmooth optimization;    k-means algorithm;    global k-means algorithm;   

DOI  :  10.1016/j.patcog.2008.04.004

来源: Elsevier

【 摘 要 】

k-Means algorithm and its variations are known to be fast clustering algorithms. However, they are sensitive to the choice of starting points and inefficient for solving clustering problems in large data sets. Recently, a new version of the k-means algorithm, the global k-means algorithm has been developed. It is an incremental algorithm that dynamically adds one cluster center at a time and uses each data point as a candidate for the k-th cluster center. Results of numerical experiments show that the global k-means algorithm considerably outperforms the k-means algorithms. In this paper, a new version of the global k-means algorithm is proposed. A starting point for the k-th cluster center in this algorithm is computed by minimizing an auxiliary cluster function. Results of numerical experiments on 14 data sets demonstrate the superiority of the new algorithm, however, it requires more computational time than the global k-means algorithm. (C) 2008 Elsevier Ltd. All rights reserved.

【 授权许可】

Free