Improving K-means clustering algorithm with the intelligent water drops (IWD) algorithm

ISSN： 1759-1163

Source： International Journal of Data Mining, Modelling and Management, Vol.5, Iss.4, 2013-11, pp. : 301-317

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

In this paper, the K-means algorithm for data clustering is improved by the swarm-based nature-inspired optimisation algorithm, the intelligent water drops (IWD) algorithm. The K-means algorithm is an iterative algorithm in which the number of clusters is given in advance. Although the K-means is fast to converge, it is sensitive to the initial conditions. As a result, it is often trapped in local optimums. The IWD algorithm, which mimics the actions and reactions between natural water drops in real rivers, is modified to implicitly embed in itself the main processes of the K-means algorithm. The modified algorithm called IWD-KM is tested with several well-known datasets for clustering, and its performance is compared with the K-means algorithm. The experimental results show the superiority of the proposed IWD-KM algorithm.