An improved KFCM algorithm based on artificial bee colony

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

Abstract

Kernel fuzzy C-means (KFCM) clustering Algorithm is one of the most widely used methods in data mining, but this algorithm still exists some defects, such as the local optima and sensitivity to initialization and noise data. Artificial bee colony (ABC) is a very simple, robust, stochastic global optimization tool which is used in many optimization problems. In this paper, an improved KFCM algorithm based on ABC (ABC-KFCM) is proposed. It can integrate advantages of KFCM and ABC algorithm. According to the test, compared with the FCM and KFCM clustering algorithm, the proposed algorithm improves the optimization ability of the algorithm, the number of iterations is fewer, and the convergence speed is faster. In addition, there is also a large improved in the clustering result. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhao, X., & Zhang, S. (2011). An improved KFCM algorithm based on artificial bee colony. In Communications in Computer and Information Science (Vol. 237 CCIS, pp. 190–198). https://doi.org/10.1007/978-3-642-24282-3_26

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