Logo image
Back
A noise-resistant fuzzy c means algorithm for clustering
Conference proceeding

A noise-resistant fuzzy c means algorithm for clustering

K.K Chintalapudi, M Kam and IEEE
1998 IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36228), v 2, pp 1458-1463 vol.2
1998
DOI: https://doi.org/10.1109/FUZZY.1998.686334

Abstract

Art Clustering algorithms Laboratories Lagrangian functions Minimization methods Noise generators Partitioning algorithms Prototypes
Probabilistic clustering techniques use the concept of memberships to describe the degree by which a vector belongs to a cluster. The use of memberships provides probabilistic methods with more realistic clustering than "hard" techniques. However, fuzzy schemes (like the fuzzy c means algorithm, FCM) are often sensitive to outliers. We review four existing algorithms, devised to reduce this sensitivity. These are: the noise cluster (NC) algorithm of Dave (1991), the possibilistic c means (PCM) scheme of Krishnapuram and Keller (1996), the least biased fuzzy clustering (LBFC) method of Beni and Liu (1994), and the fuzzy possibilistic c means algorithm of Pal et al. (1997). We then propose the new credibilistic fuzzy c means (CFCM) algorithm to improve on these methods. It uses a new variable, credibility of a vector, which measures the typicality of the vector to the whole data set. By taking credibility into account CFCM generates centroids which are less sensitive to outliers than other techniques, and closer to the centroids generated when the outliers are artificially removed.

Metrics

13 Record Views
45 citations in Web of Science
72 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Artificial Intelligence
Logo image