Fuzzy C-Means, Gustafson-Kessel FCM, and kernel-based FCM: A comparative study

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

Abstract

This paper is concerned with a comparative study of the performance of fuzzy clustering algorithms Fuzzy C-Means (FCM), Gustafson-Kessel FCM (GK-FCM) and two variations of kernel-based FCM. One kernel-based FCM (KFCM) retains prototypes in the input space while the other (MKFCM) implicitly retains prototypes in the feature space. The two performance criteria used in the evaluation of the clustering algorithm deal with produced classification rate and reconstruction error. We experimentally demonstrate that the kernel-based FCM algorithms do not produce significant improvement over standard FCM for most data sets under investigation It is shown that the kernel-based FCM algorithms appear to be highly sensitive to the selection of the values of the kernel parameters. © 2007 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Graves, D., & Pedrycz, W. (2007). Fuzzy C-Means, Gustafson-Kessel FCM, and kernel-based FCM: A comparative study. Advances in Soft Computing, 41, 140–149. https://doi.org/10.1007/978-3-540-72432-2_15

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