Fast modified global k-means algorithm for incremental cluster construction

doi:10.1016/j.patcog.2010.10.018

2011-04-01

105

PRE

Adil Bagirov *

Julien Ugon

DOI：10.1016/j.patcog.2010.10.018

原文链接

原文求助

摘要

En 中文

The k-means algorithm and its variations are known to be fast clustering algorithms. However, they are sensitive to the choice of starting points and are inefficient for solving clustering problems in large datasets. Recently, incremental approaches have been developed to resolve difficulties with the choice of starting points. The global k-means and the modified global k-means algorithms are based on such an approach. They iteratively add one cluster center at a time. Numerical experiments show that these algorithms considerably improve the k-means algorithm. However, they require storing the whole affinity matrix or computing this matrix at each iteration. This makes both algorithms time consuming and memory demanding for clustering even moderately large datasets. In this paper, a new version of the modified global k-means algorithm is proposed. We introduce an auxiliary cluster function to generate a set of starting points lying in different parts of the dataset. We exploit information gathered in previous iterations of the incremental algorithm to eliminate the need of computing or storing the whole affinity matrix and thereby to reduce computational effort and memory usage. Results of numerical experiments on six standard datasets demonstrate that the new algorithm is more efficient than the global and the modified global k-means algorithms. (C) 2010 Elsevier Ltd. All rights reserved.

Keyword:

Minimum sum-of-squares clustering

Nonsmooth optimization

k-means algorithm

Global k-means algorithm