Improving K-means clustering algorithm with the intelligent water drops (IWD) algorithm
by Hamed Shah-Hosseini
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 5, No. 4, 2013

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.

Online publication date: Tue, 29-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com