A new preprocessor to fuzzy c-means algorithm

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

Abstract

The fuzzy clustering scenario resulting from Fuzzy c-Means Algorithm (FCM) is highly sensitive to input parameters, number of clusters c and randomly initialized fuzzy membership matrix. Traditionally, the optimal fuzzy clustering scenario is arrived by exhaustive, repetitive invocations of FCM for different c values. In this paper, a new preprocessor based on Simplified Fuzzy Min-Max Neural Network (FMMNN) is proposed for FCM. The new preprocessor results in an estimation of the number of clusters in a given dataset and an initialization for fuzzy membership matrix. FCM algorithm with embeded preprocessor is named as FCMPre. Comparative experimental results of FCMPre with FCM based on benchmark datasets, empirically established that FCMPre discovers optimal (or near optimal) fuzzy clustering scenarios without exhaustive invocations of FCM along with obtaining significant computational gains.

Cite

CITATION STYLE

APA

Raveen, S., Prasad, P. S. V. S. S., & Chillarige, R. R. (2014). A new preprocessor to fuzzy c-means algorithm. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8875, 124–135. https://doi.org/10.1007/978-3-319-13365-2_12

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