Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory
From MaRDI portal
Recommendations
- A computationally efficient approximation of Dempster-Shafer theory
- Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
- Comparing approximate reasoning and probabilistic reasoning using the Dempster-Shafer framework
- Information-theoretic measures associated with rough set approximations
- Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
- Approximated information analysis in Bayesian inference
- Entropy for evaluation of Dempster-Shafer belief function models
- Approximations and uncertainty measures in incomplete information systems
- ON THE COMPUTATION OF UNCERTAINTY MEASURE IN DEMPSTER-SHAFER THEORY
- An interval Dempster-Shafer approach
Cited in
(8)- Resource bounded and anytime approximation of belief function computations.
- Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
- Focal points and their implications for Möbius transforms and Dempster-Shafer theory
- Combination algorithm for evidence theory utilizing energy function
- Efficient Möbius transformations and their applications to D-S theory
- A computationally efficient approximation of Dempster-Shafer theory
- The approximation method of the belief function based on the sub focal elements of the large focal elements
- Comparing approximate reasoning and probabilistic reasoning using the Dempster-Shafer framework
This page was built for publication: Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600533)