A new algorithm for initial cluster centers in k-means algorithm

Murat Erişoğlu

doi:10.1016/j.patrec.2011.07.011

A new algorithm for initial cluster centers in k-means algorithm

2011-10-01

144

PRE

AI

DOI：10.1016/j.patrec.2011.07.011

Original

Original request for help

Save

Abstract

En 中文

Clustering is one of the widely used knowledge discovery techniques to reveal structures in a dataset that can be extremely useful to the analyst. In iterative clustering algorithms the procedure adopted for choosing initial cluster centers is extremely important as it has a direct impact on the formation of final clusters. Since clusters are separated groups in a feature space, it is desirable to select initial centers which are well separated. In this paper, we have proposed an algorithm to compute initial cluster centers for k-means algorithm. The algorithm is applied to several different datasets in different dimension for illustrative purposes. It is observed that the newly proposed algorithm has good performance to obtain the initial cluster centers for the k-means algorithm. (C) 2011 Elsevier B.V. All rights reserved.

Keywords:

k-Means algorithm

Initial cluster centers

Rand index

Error percentage

Wilks' lambda test statistic

A new algorithm for initial cluster centers in k-means algorithm

Abstract

Journal

Organization

Cited Papers