Bilateral Weighted Fuzzy C-Means Clustering

Nowadays, the fuzzy c-means method has become one of the most popular clustering methods based on minimization of a criterion function. however, the performance of this clustering algorithm may be significantly degraded in the presence of noise. this paper presents a robust clustering algorithm called bilateral weighted fuzzy c- means (bwfcm). we used a new objective function that uses some kinds of weights for reducing the effect of noises in clustering. experimental results using, two artificial datasets, five real datasets, viz., iris, cancer, wine, glass and a speech corpus used in a gmm-based speaker identification task show that compared to three well-known clustering algorithms, namely, the fuzzy possibilistic c-means, credibilistic fuzzy c-means and density weighted fuzzy c-means, our approach is less sensitive to outliers and noises and has an acceptable computational complexity.