The possibilistic C-means algorithm: insights and recommendations
- 1 August 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 4 (3) , 385-393
- https://doi.org/10.1109/91.531779
Abstract
Recently, the possibilistic C-means algorithm (PCM) was proposed to address the drawbacks associated with the constrained memberships used in algorithms such as the fuzzy C-means (FCM). In this issue, Barni et al. (1996) report a difficulty they faced while applying the PCM, and note that it exhibits an undesirable tendency to converge to coincidental clusters. The purpose of this paper is not just to address the issues raised by Barni et al., but to go further and analytically examines the underlying principles of the PCM and the possibilistic approach, in general. We analyze the data sets used by Barni et al. and interpret the results reported by them in the light of our findings.Keywords
This publication has 9 references indexed in Scilit:
- Generation of membership functions via possibilistic clusteringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Comments on "A possibilistic approach to clustering"IEEE Transactions on Fuzzy Systems, 1996
- Estimation of Membership Functions for Pattern Recognition and Computer VisionPublished by Springer Nature ,1995
- A least biased fuzzy clustering methodPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- A possibilistic approach to clusteringIEEE Transactions on Fuzzy Systems, 1993
- Fitting an unknown number of lines and planes to image data through compatible cluster mergingPattern Recognition, 1992
- Robust Regression and Outlier DetectionPublished by Wiley ,1987
- Robust StatisticsPublished by Wiley ,1981
- Pattern Recognition with Fuzzy Objective Function AlgorithmsPublished by Springer Nature ,1981