Journal
SOFT COMPUTING
Volume 23, Issue 12, Pages 4081-4095Publisher
SPRINGER
DOI: 10.1007/s00500-018-3057-5
Keywords
Simple water cycle algorithm; Percolation operator; Clustering analysis; Soft computing
Categories
Funding
- National Science Foundation of China [61463007]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available