Robust weighted fuzzy c-means clustering

Nowadays, the fuzzy c-means method (FCM) became 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 robust weighted fuzzy c-means (RWFCM). We used a new objective function that uses some kinds of weights for reducing the infection of noises in clustering. Experimental results show that compared to three well-known clustering algorithms, namely, the fuzzy possibilistic c-means (FPCM), credibilistic fuzzy c-means (CFCM) and density weighted fuzzy c-means (DWFCM), RWFCM is less sensitive to outlier and noise and has an acceptable computational complexity.

[1]  Jung-Hua Wang,et al.  A new robust clustering algorithm-density-weighted fuzzy c-means , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[2]  Zhaohong Deng,et al.  Robust fuzzy clustering neural network based on epsilon-insensitive loss function , 2007, Appl. Soft Comput..

[3]  James C. Bezdek,et al.  A mixed c-means clustering model , 1997, Proceedings of 6th International Fuzzy Systems Conference.

[4]  James M. Keller,et al.  A possibilistic approach to clustering , 1993, IEEE Trans. Fuzzy Syst..

[5]  Jacek M. Leski,et al.  Towards a robust fuzzy clustering , 2003, Fuzzy Sets Syst..

[6]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[7]  Moshe Kam,et al.  A noise-resistant fuzzy c means algorithm for clustering , 1998, 1998 IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36228).