The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A possibilistic fuzzy c-means clustering algorithm
Abstract
In 1997, we proposed the fuzzy-possibilistic c-means (FPCM) model and algorithm that generated both membership and typicality values when clustering unlabeled data. FPCM constrains the typicality values so that the sum over all data points of typicalities to a cluster is one. The row sum constraint produces unrealistic typicality values for large data sets. In this paper, we propose a new model called possibilistic-fuzzy c-means (PFCM) model. PFCM produces memberships and possibilities simultaneously, along with the usual point prototypes or cluster centers for each cluster. PFCM is a hybridization of possibilistic c-means (PCM) and fuzzy c-means (FCM) that often avoids various problems of PCM, FCM and FPCM. PFCM solves the noise sensitivity defect of FCM, overcomes the coincident clusters problem of PCM and eliminates the row sum constraints of FPCM. We derive the first-order necessary conditions for extrema of the PFCM objective function, and use them as the basis for a standard alternating optimization approach to finding local minima of the PFCM objective functional. Several numerical examples are given that compare FCM and PCM to PFCM. Our examples show that PFCM compares favorably to both of the previous models. Since PFCM prototypes are less sensitive to outliers and can avoid coincident clusters, PFCM is a strong candidate for fuzzy rule-based system identification.
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
Applied Multivariate Statistical Analysis.
Johnson, A. R., & Wichern, D. W. (1988) · Biometrics · doi:10.2307/2531616 · Cited by 11,353
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Self-citationA 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
Fuzzy models for pattern recognition
Bezdek, J. C., & Pal, S. K. (1994) · Cited by 832
Self-citationThe possibilistic C-means algorithm: insights and recommendations
Krishnapuram, R., & Keller, J. M. (1996) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.531779 · Cited by 731
Self-citationFuzzy models for pattern recognition : methods that search for structures in data
Bezdek, J. C., & Pal, S. K. (1992) · Institute of Electrical and Electronics Engineers eBooks · Cited by 478
Self-citationAdaptive fuzzy c-shells clustering and detection of ellipses
Dave, R. N., & Bhaswan, K. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.159055 · Cited by 201
Cited by
Semi-supervised learning based distributed attack detection framework for IoT
Rathore, S., & Park, J. H. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2018.05.049 · Cited by 355
Sarma, B. B., Maurer, F., Doronkin, D. E., & Grunwaldt, J.-D. (2023) · Chemical Reviews · doi:10.1021/acs.chemrev.2c00495 · Cited by 291
A systematic literature review for network intrusion detection system (IDS)
Abdulganiyu, O. H., Ait Tchakoucht, T., & Saheed, Y. K. (2023) · International Journal of Information Security · doi:10.1007/s10207-023-00682-2 · Cited by 279
Fuzzy bag-of-words model for document representation
Zhao, R., & Mao, K. (2018) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2017.2690222 · Cited by 252
Metadata
- Authors
- Pal, N. R., Pal, K., Keller, J. M., & Bezdek, J. C.
- Venue
- IEEE Transactions on Fuzzy Systems
- Published
- 2005-08
- Volume
- 13
- Issue
- 4
- Pages
- 517-530
- ISSN
- 1063-6706 (ISSN-L)
- OpenAlex
- W2167428023
- Cited by
- 1,279
- References
- 8
- FWCI
- 24.73
- 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
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.