Possibilistic evidential clustering
From MaRDI portal
Publication:2804733
zbMATH Open1335.68199MaRDI QIDQ2804733FDOQ2804733
John Puentes, Anas Dahabiah, Basel Solaiman
Publication date: 4 May 2016
Recommendations
- Clustering Approach Using Belief Function Theory
- On possibilistic clustering with repulsion constraints for imprecise data
- A heuristic approach to possibilistic clustering. Algorithms and applications
- ECM: An evidential version of the fuzzy \(c\)-means algorithm
- Clustering of vaguely defined objects.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cited In (8)
- On the Use of Clustering in Possibilistic Decision Tree Induction
- Advances in Artificial Intelligence – SBIA 2004
- Handling possibilistic labels in pattern classification using evidential reasoning.
- Theory of possibilities in data clusterization
- Possibilistic Clustering Methods for Interval-Valued Data
- NN-EVCLUS: neural network-based evidential clustering
- An improved exact algorithm for least-squares unidimensional scaling
- Possibility theoretic clustering and its preliminary application to large image segmentation
This page was built for publication: Possibilistic evidential clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804733)
