Improved Water Cycle Algorithm and K-Means Based Method for Data Clustering

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

K-means is a classical clustering method, but it is easy to fall into local optimums because of poor centers. Inspired by the good global search performance of Inter-Peer Communication Mechanism Based Water Cycle Algorithm (IPCWCA), three hybrid methods based on IPCWCA and K-means are presented in this paper, which are used to address the shortcoming of K-means and explore better clustering approaches. The hybrid methods consist of two modules successively: IPCWCA module and K-means module, which means that K-means module will inherit the best individual from IPCWCA module to start its clustering process. Compared with original K-means and WCA + K-means methods on eight datasets (including two customer segmentation datasets) based on SSE, accuracy and Friedman test, proposed methods show greater potential to solve clustering problems both in simple and customer segmentation datasets.

Cite

CITATION STYLE

APA

Liu, H., Tan, L., Jin, L., & Niu, B. (2020). Improved Water Cycle Algorithm and K-Means Based Method for Data Clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12465 LNAI, pp. 579–589). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-60796-8_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free