A simple water cycle algorithm with percolation operator for clustering analysis

The clustering problem consists in the discovery of interesting groups in a data set. Such task is very important and widely tacked in the literature. The K-means algorithm is one of the most popular techniques in clustering. However, the performance of the K-means algorithm depends highly on initial cluster centers and converges to local minima. This paper proposed a simple water cycle algorithm (WCA) with percolation operator for clustering analysis. The simple WCA discards the process of rainfall. The evolutionary process is only controlled by the process of flowing and percolation operator. The process of flowing can be thoroughly search the solution space; on the other hand, the percolation operator can find the solution more accuracy and represents the local search. Ten data sets are selected to evaluate the performance of proposed algorithm; the experiment results show that the proposed algorithm performs significantly better in terms of the quality, speed and stability of the final solutions.

[1]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[2]  Nigel K. L. Pope,et al.  Cluster analysis of marketing data examining on-line shopping orientation: a comparison of k-means and rough clustering approaches , 2002 .

[3]  Xiaofeng Wang,et al.  A Novel Density-Based Clustering Framework by Using Level Set Method , 2009, IEEE Transactions on Knowledge and Data Engineering.

[4]  Ira Assent,et al.  Clustering multidimensional sequences in spatial and temporal databases , 2007, Knowledge and Information Systems.

[5]  OzturkCelal,et al.  A novel clustering approach , 2011 .

[6]  Andries Petrus Engelbrecht,et al.  Data clustering using particle swarm optimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[7]  H. Modares,et al.  Combining PSO and k-means to enhance data clustering , 2008, 2008 International Symposium on Telecommunications.

[8]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[9]  Yunlong Zhu,et al.  A Clustering Approach Using Cooperative Artificial Bee Colony Algorithm , 2010 .

[10]  Ardeshir Bahreininejad,et al.  Water cycle algorithm - A novel metaheuristic optimization method for solving constrained engineering optimization problems , 2012 .

[11]  Ardeshir Bahreininejad,et al.  Water cycle algorithm with evaporation rate for solving constrained and unconstrained optimization problems , 2015, Appl. Soft Comput..

[12]  Ardeshir Bahreininejad,et al.  Water cycle algorithm for solving multi-objective optimization problems , 2014, Soft Computing.

[13]  Xin-She Yang,et al.  Flower Pollination Algorithm for Global Optimization , 2012, UCNC.

[14]  B. Kulkarni,et al.  An ant colony approach for clustering , 2004 .

[15]  Yang Li,et al.  Co-evolution-based immune clonal algorithm for clustering , 2015, Soft Computing.

[16]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[17]  Ardeshir Bahreininejad,et al.  Water cycle, mine blast and improved mine blast algorithms for discrete sizing optimization of truss structures , 2015 .

[18]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization method for image clustering , 2005, Int. J. Pattern Recognit. Artif. Intell..

[19]  Dervis Karaboga,et al.  A novel clustering approach: Artificial Bee Colony (ABC) algorithm , 2011, Appl. Soft Comput..

[20]  Rehab F. Abdel-Kader.  Genetically Improved PSO Algorithm for Efficient Data Clustering , 2010, 2010 Second International Conference on Machine Learning and Computing.

[21]  Ali Sadollah,et al.  Water cycle algorithm for solving constrained multi-objective optimization problems , 2015, Appl. Soft Comput..

[22]  Hillol Kargupta,et al.  Approximate Distributed K-Means Clustering over a Peer-to-Peer Network , 2009, IEEE Transactions on Knowledge and Data Engineering.