The DOI matches its Crossref record.
A possibilistic approach to clustering
Abstract
The clustering problem is cast in the framework of possibility theory. The approach differs from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values can be interpreted as degrees of possibility of the points belonging to the classes, i.e., the compatibilities of the points with the class prototypes. An appropriate objective function whose minimum will characterize a good possibilistic partition of the data is constructed, and the membership and prototype update equations are derived from necessary conditions for minimization of the criterion function. The advantages of the resulting family of possibilistic algorithms are illustrated by several examples.>
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
Cited by
Pimentel, M. A. F., Clifton, D. A., Clifton, L., & Tarassenko, L. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.12.026 · Cited by 1,649
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
Future Airspace Design by Dynamic Sectorization
Schultz, M., Gerdes, I., Standfuß, T., & Temme, A. (2019) · Lecture Notes in Electrical Engineering · doi:10.1007/978-981-13-7086-1_2 · Cited by 11
Metadata
- Authors
- Krishnapuram, R., & Keller, J. M.
- Venue
- IEEE Transactions on Fuzzy Systems
- Published
- 1993-05
- Volume
- 1
- Issue
- 2
- Pages
- 98-110
- ISSN
- 1063-6706 (ISSN-L)
- OpenAlex
- W2120688485
- Cited by
- 2,496
- References
- 0
- FWCI
- 19.26
- 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.
