A computationally efficient approximation of Dempster-Shafer theory
From MaRDI portal
Recommendations
- Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
- The combination of belief: When and how fast?
- A logic-based analysis of Dempster-Shafer theory
- Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory
- scientific article; zbMATH DE number 51153
Cited in
(40)- Resource bounded and anytime approximation of belief function computations.
- A new definition of entropy of belief functions in the Dempster-Shafer theory
- Decision making in the TBM: the necessity of the pignistic transformation
- Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
- Ordered valuation algebras: A generic framework for approximating inference
- On the specificity of evidences
- Belief functions and rough sets: survey and new insights
- Dempster-Shafer approximations and probabilistic bounds in statistical matching
- Outer approximating coherent lower probabilities with belief functions
- Decision-making with belief functions: a review
- On the justification of Dempster's rule of combination
- On the plausibility transformation method for translating belief function models to probability models
- An uncertainty interchange format with imprecise probabilities
- Approximation of data by decomposable belief models
- scientific article; zbMATH DE number 4176504 (Why is no real title available?)
- INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH
- A PRINCIPLE OF UNCERTAINTY AND INFORMATION INVARIANCE*
- On the Orthogonal Projection of a Belief Function
- On Latent Belief Structures
- A Generalization of the Pignistic Transform for Partial Bet
- The Intersection Probability and Its Properties
- Dempster-shafer approach in propositional logic
- scientific article; zbMATH DE number 1126954 (Why is no real title available?)
- Implementing belief function computations
- On the relative belief transform
- Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory
- ON POSSIBILISTIC AND PROBABILISTIC APPROXIMATIONS OF UNRESTRICTED BELIEF FUNCTIONS BASED ON THE CONCEPT OF FUZZY T-PREORDER
- On transformations of belief functions to probabilities
- APPROXIMATION OF BELIEF FUNCTIONS
- On the selection of an optimal outer approximation of a coherent lower probability
- Geometry of relative plausibility and relative belief of singletons
- Dempster-Shafer Theory: Ηow Constraint Programming Can Help
- An Extension of Specificity-Based Approximations to Other Belief Function Relations
- Evidence combination with multi-granularity belief structure for pattern classification
- A robust multi-source transfer classification method based on belief functions for cross-domain pattern recognition
- r-ERBFN: an extension of the evidential RBFN accounting for the dependence between positive and negative evidence
- Indistinguishability relations in Dempster-Shafer theory of evidence
- Consonant approximations of belief functions
- A logic-based analysis of Dempster-Shafer theory
- Comparing approximate reasoning and probabilistic reasoning using the Dempster-Shafer framework
This page was built for publication: A computationally efficient approximation of Dempster-Shafer theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4734790)