ECM: An evidential version of the fuzzy c-means algorithm

DOI10.1016/J.PATCOG.2007.08.014MaRDI QIDQ2469734zbMATH OpenOpenAlexFDO

Authors T. Denœux, M.-H. Masson

Publication date 7 February 2008

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2007.08.014

zbMATH Keywords

clusteringrobustnessunsupervised learningbelief functionscluster validityDempster-Shafer theoryevidence theory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• CECM: constrained evidential \(C\)-means algorithm
• TS-models from evidential clustering
• Transfer Evidential C-Means Clustering
• Fast Unfolding of Credal Partitions in Evidential Clustering
• Possibilistic evidential clustering

Cites work

• scientific article; zbMATH DE number 3793445 (Why is no real title available?)
• scientific article; zbMATH DE number 193123 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• scientific article; zbMATH DE number 1269589 (Why is no real title available?)
• scientific article; zbMATH DE number 2006449 (Why is no real title available?)
• scientific article; zbMATH DE number 1472778 (Why is no real title available?)
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
• Cluster Validity with Fuzzy Sets
• Data analysis with fuzzy clustering methods
• Decision making in the TBM: the necessity of the pignistic transformation
• Defining belief functions using mathematical morphology - application to image fusion under imprecision
• On relational possibilistic clustering
• On the normalization of fuzzy belief structures
• On the plausibility transformation method for translating belief function models to probability models
• Relational duals of the c-means clustering algorithms
• The transferable belief model
• Uncertainty-based information. Elements of generalized information theory
• Uniqueness of information measure in the theory of evidence
• Unsupervised rough set classification using GAs

Cited in

(52)

• Soft clustering
• GFDC: a granule fusion density-based clustering with evidential reasoning
• Representations of uncertainty in AI: beyond probability and possibility
• Uncertain c-means clustering method with application to imprecise observations
• Belief functions and rough sets: survey and new insights
• Fuzzy sets for image processing and understanding
• Kernel-based methods to identify overlapping clusters with linear and nonlinear boundaries
• On a new evidential C-means algorithm with instance-level constraints
• A fuzzy clustering approach for fuzzy data based on a generalized distance
• Prediction of future observations using belief functions: a likelihood-based approach
• Possibilistic evidential clustering
• Evidential Clustering Based on Transfer Learning
• Belief Functions and Cluster Ensembles
• Fuzzy and possibilistic clustering for fuzzy data
• A distributional framework for evaluation, comparison and uncertainty quantification in soft clustering
• Combination of partially non-distinct beliefs: the cautious-adaptive rule
• Evidence integration credal classification algorithm versus missing data distributions
• NN-EVCLUS: neural network-based evidential clustering
• Evidential prototype-based clustering based on transfer learning
• TS-models from evidential clustering
• SELP: semi-supervised evidential label propagation algorithm for graph data clustering
• Evidential evolving C-means clustering method based on artificial bee colony algorithm with variable strings and interactive evaluation mode
• Evidential Weighted Multi-view Clustering
• Fast Unfolding of Credal Partitions in Evidential Clustering
• A general framework for evaluating and comparing soft clusterings
• DILS: constrained clustering through dual iterative local search
• Possibilistic fuzzy c-means with partial supervision
• Adaptive density-based clustering algorithm with shared KNN conflict game
• Calibrated model-based evidential clustering using bootstrapping
• Toward credible belief base revision
• Transfer Evidential C-Means Clustering
• CECM: constrained evidential \(C\)-means algorithm
• Multiscale probability transformation of basic probability assignment
• Belief functions clustering for epipole localization
• Ensemble clustering in the belief functions framework
• Decision tree classifiers for evidential attribute values and class labels
• Speeding up the large-scale consensus fuzzy clustering for handling big data
• Extending stochastic ordering to belief functions on the real line
• A choice model with imprecise ordinal evaluations
• Credal Clustering for Imbalanced Data
• On possibilistic clustering with repulsion constraints for imprecise data
• Detecting outliers in categorical data through rough clustering
• Rederivation of the fuzzy-possibilistic clustering objective function through Bayesian inference
• A new credibilistic clustering algorithm
• Joint feature transformation and selection based on Dempster-Shafer theory
• Shape from silhouette using Dempster-Shafer theory
• Fuzzy clustering using the convex hull as geometrical model
• Fast semi-supervised evidential clustering
• A distributional approach for soft clustering comparison and evaluation
• Keypoint descriptor fusion with Dempster-Shafer theory
• Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering
• On indexing evidential data

Describes a project that uses

Uses Software

• evclust

This page was built for publication: ECM: An evidential version of the fuzzy \(c\)-means algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469734)