Gradient based fuzzy C-means algorithm with a mercer kernel

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

Abstract

In this paper, a clustering algorithm based on Gradient Based Fuzzy C-Means with a Mercer Kernel, called GBFCM (MK), is proposed. The kernel method adopted in this paper implicitly performs nonlinear mapping of the input data into a high-dimensional feature space. The proposed GBFCM (MK) algorithm is capable of dealing with nonlinear separation boundaries among clusters. Experiments on a synthetic data set and several real MPEG data sets show that the proposed algorithm gives better classification accuracies than both the conventional k-means algorithm and the GBFCM. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Park, D. C., Tran, C. N., & Park, S. (2006). Gradient based fuzzy C-means algorithm with a mercer kernel. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 1038–1043). Springer Verlag. https://doi.org/10.1007/11759966_152

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