Cluster center initialization algorithm for K-means clustering

doi:10.1016/j.patrec.2004.04.007

Cluster center initialization algorithm for K-means clustering

2004-08-01

503

PRE

AI

DOI：10.1016/j.patrec.2004.04.007

原文链接

原文求助

摘要

En 中文

Performance of iterative clustering algorithms which converges to numerous local minima depend highly on initial cluster centers. Generally initial cluster centers are selected randomly. In this paper we propose an algorithm to compute initial cluster centers for K-means clustering. This algorithm is based on two observations that some of the patterns are very similar to each other and that is why they have same cluster membership irrespective to the choice of initial cluster centers. Also, an individual attribute may provide some information about initial cluster center. The initial cluster centers computed using this methodology are found to be very close to the desired cluster centers, for iterative clustering algorithms. This procedure is applicable to clustering algorithms for continuous data. We demonstrate the application of proposed algorithm to K-means clustering algorithm. The experimental results show improved and consistent solutions using the proposed algorithm. (C) 2004 Elsevier B.V. All rights reserved.

Keyword:

K-means clustering

initial cluster centers

cost function

density based multiscale data condensation

Cluster center initialization algorithm for K-means clustering

摘要

期刊

机构

引用论文