Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
From MaRDI portal
(Redirected from Publication:1809376)
Abstract: The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the main points of criticism this formalism has to face. To overcome this difficulty various approximation algorithms have been suggested that aim at reducing the number of focal elements in the belief functions involved. Besides introducing a new algorithm using this method, this paper describes an empirical study that examines the appropriateness of these approximation procedures in decision making situations. It presents the empirical findings and discusses the various tradeoffs that have to be taken into account when actually applying one of these methods.
Recommendations
- A computationally efficient approximation of Dempster-Shafer theory
- Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory
- Algorithms for Dempster-Shafer theory
- Comparing approximate reasoning and probabilistic reasoning using the Dempster-Shafer framework
- On \(\rho\) in a decision-theoretic apparatus of Dempster-Shafer theory
- scientific article; zbMATH DE number 1785997
- scientific article; zbMATH DE number 588414
- Dempster-Shafer approximations and probabilistic bounds in statistical matching
- Dempster-Shafer reasoning in large partially ordered sets: applications in machine learning
- Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
Cites work
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- A computationally efficient approximation of Dempster-Shafer theory
- A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
- Consonant approximations of belief functions
- Dempster's rule of combination is {\#}P-complete
- Uncertainty and intelligent systems. 2nd International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems IPMU '88, Urbino, Italy, July 4-7, 1988. Proceedings.
- Upper and Lower Probabilities Induced by a Multivalued Mapping
Cited in
(41)- Interpreting evidential distances by connecting them to partial orders: application to belief function approximation
- Algorithms for Dempster-Shafer theory
- Distances in evidence theory: comprehensive survey and generalizations
- Approximation techniques for the transformation of fuzzy sets into random sets
- On the relative belief transform
- A new distance measure between two basic probability assignments based on penalty coefficient
- The evidential reasoning approach for multiple attribute decision analysis using interval belief degrees
- Belief and Plausibility Functions on the Space of Scalar Products and Applications
- Classification with dynamic reducts and belief functions
- Geometry of relative plausibility and relative belief of singletons
- Color image segmentation based on three levels of texture statistical evaluation
- The Intersection Probability and Its Properties
- Dempster-Shafer clustering using Potts spin mean field theory
- Classification systems based on rough sets under the belief function framework
- A computationally efficient approximation of Dempster-Shafer theory
- Analytic hierarchy process for multi-sensor data fusion based on belief function theory
- How to randomly generate mass functions
- A modified combination rule of DS theory and its approximation algorithm
- On the combination and normalization of interval-valued belief structures
- Dempster-Shafer evidential theory for the automated selection of parameters for Talbot's method contours and application to matrix exponentiation
- APPROXIMATION OF BELIEF FUNCTIONS
- Ordered valuation algebras: A generic framework for approximating inference
- On the Orthogonal Projection of a Belief Function
- Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame.
- Comparing approximate reasoning and probabilistic reasoning using the Dempster-Shafer framework
- Indistinguishability relations in Dempster-Shafer theory of evidence
- New distances between bodies of evidence based on Dempsterian specialization matrices and their consistency with the conjunctive combination rule
- ON POSSIBILISTIC AND PROBABILISTIC APPROXIMATIONS OF UNRESTRICTED BELIEF FUNCTIONS BASED ON THE CONCEPT OF FUZZY T-PREORDER
- Resource bounded and anytime approximation of belief function computations.
- An Extension of Specificity-Based Approximations to Other Belief Function Relations
- Evidence combination with multi-granularity belief structure for pattern classification
- Environmental impact assessment using the evidential reasoning approach
- A Gibbs Sampler for a Class of Random Convex Polytopes
- Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory
- Towards an Alarm for Opposition Conflict in a Conjunctive Combination of Belief Functions
- Combination algorithm for evidence theory utilizing energy function
- Dempster-Shafer approximations and probabilistic bounds in statistical matching
- The evidential reasoning approach for multi-attribute decision analysis under interval uncertainty
- INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH
- The evidential reasoning approach for mada under both probabilistic and fuzzy uncertainties
- Representations of uncertainty in AI: beyond probability and possibility
This page was built for publication: Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809376)
