ON POSSIBILISTIC AND PROBABILISTIC APPROXIMATIONS OF UNRESTRICTED BELIEF FUNCTIONS BASED ON THE CONCEPT OF FUZZY T-PREORDER
From MaRDI portal
(Redirected from Publication:4822682)
Recommendations
Cites work
- A computationally efficient approximation of Dempster-Shafer theory
- Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
- Consonant approximations of belief functions
- Fuzzy sets as a basis for a theory of possibility
- On the structure of F-indistinguishability operators
- Similarity relations and fuzzy orderings
Cited in
(6)- Approximation by Filter Functions
- Consonant approximations of belief functions
- A MAP CHARACTERIZING THE FUZZY POINTS AND COLUMNS OF A T-INDISTINGUISHABILITY OPERATOR
- An uncertainty interchange format with imprecise probabilities
- Semantics of the relative belief of singletons
- APPROXIMATION OF BELIEF FUNCTIONS
This page was built for publication: ON POSSIBILISTIC AND PROBABILISTIC APPROXIMATIONS OF UNRESTRICTED BELIEF FUNCTIONS BASED ON THE CONCEPT OF FUZZY T-PREORDER
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4822682)