The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The possibilistic C-means algorithm: insights and recommendations
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
Robust Regression and Outlier Detection
Piepel, G. F. (1989) · Technometrics · doi:10.1080/00401706.1989.10488524 · Cited by 6,144
Robust Regression and Outlier Detection
Rousseeuw, P. J., & Leroy, A. M. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/0471725382 · Cited by 5,609
Pattern Recognition Principles
(2009) · Classification Methods for Remotely Sensed Data, Second Edition · doi:10.1201/9781420090741.ch2 · Cited by 3,188
A possibilistic approach to clustering
Krishnapuram, R., & Keller, J. M. (1993) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.227387 · Cited by 2,496
Self-citationFuzzy clustering with a fuzzy covariance matrix
Gustafson, D., & Kessel, W. (1978) · 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes · doi:10.1109/cdc.1978.268028 · Cited by 1,978
Robust clustering methods: a unified view
Dave, R. N., & Krishnapuram, R. (1997) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.580801 · Cited by 711
Self-citationA least biased fuzzy clustering method
Beni, G., & Liu, X. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.310694 · Cited by 88
Cited by
A possibilistic fuzzy c-means clustering algorithm
Pal, N. R., Pal, K., Keller, J. M., & Bezdek, J. C. (2005) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2004.840099 · Cited by 1,279
Self-citationA survey of kernel and spectral methods for clustering
Filippone, M., Camastra, F., Masulli, F., & Rovetta, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.05.018 · Cited by 827
An overview of clustering methods
Omran, M. G. H., Engelbrecht, A. P., & Salman, A. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11602 · Cited by 424
Automatic segmentation of non-enhancing brain tumors in magnetic resonance images
Fletcher-Heath, L. M., Hall, L. O., Goldgof, D. B., & Murtagh, F. R. (2001) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(00)00073-7 · Cited by 293
Unsupervised Performance Evaluation of Image Segmentation
Chabrier, S., Emile, B., Rosenberger, C., & Laurent, H. (2006) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/asp/2006/96306 · Cited by 136
Metadata
- Authors
- Krishnapuram, R., & Keller, J. M.
- Venue
- IEEE Transactions on Fuzzy Systems
- Published
- 1996
- Volume
- 4
- Issue
- 3
- Pages
- 385-393
- ISSN
- 1063-6706 (ISSN-L)
- OpenAlex
- W2125836384
- Cited by
- 731
- References
- 9
- FWCI
- 5.77
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The possibilistic C-means algorithm: insights and recommendations. https://app.cochat.ai/papers/10.1109/91.531779
- The paper
- Krishnapuram, R., & Keller, J. M. (1996). The possibilistic C-means algorithm: insights and recommendations. IEEE Transactions on Fuzzy Systems. https://doi.org/10.1109/91.531779
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.