Resource bounded and anytime approximation of belief function computations.
From MaRDI portal
Recommendations
- A computationally efficient approximation of Dempster-Shafer theory
- APPROXIMATION OF BELIEF FUNCTIONS
- Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
- Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory
- scientific article; zbMATH DE number 1849170
Cites work
- scientific article; zbMATH DE number 4178809 (Why is no real title available?)
- scientific article; zbMATH DE number 4022981 (Why is no real title available?)
- scientific article; zbMATH DE number 41270 (Why is no real title available?)
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- scientific article; zbMATH DE number 582867 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- A computationally efficient approximation of Dempster-Shafer theory
- A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence
- Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
- Binary join trees for computing marginals in the Shenoy-Shafer architecture
- Bucket elimination: A unifying framework for reasoning
- Computation in valuation algebras
- Consonant approximations of belief functions
- Dempster's rule of combination is {\#}P-complete
- INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH
- Implementing belief function computations
- Probabilistic argumentation systems
- Probabilistic argumentation systems: a new perspective on the dempster-shafer theory
- Propagating belief functions in qualitative Markov trees
- Propositional information systems
- Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals
- Symbolic and quantitative approaches to reasoning and uncertainty. European conference, ECSQARU `99. London, GB, July 5-9, 1999. Proceedings
- The transferable belief model
- Uncertain evidence and artificial analysis
- Upper and Lower Probabilities Induced by a Multivalued Mapping
Cited in
(11)- Making inferences in incomplete Bayesian networks: a Dempster-Shafer belief function approach
- On the relative belief transform
- Geometry of relative plausibility and relative belief of singletons
- scientific article; zbMATH DE number 1844497 (Why is no real title available?)
- The Intersection Probability and Its Properties
- Resource-bounded paraconsistent inference
- Computing the decomposable entropy of belief-function graphical models
- Ordered valuation algebras: A generic framework for approximating inference
- On the Orthogonal Projection of a Belief Function
- Inference in directed evidential networks based on the transferable belief model
- Active tuples-based scheme for bounding posterior beliefs
This page was built for publication: Resource bounded and anytime approximation of belief function computations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399499)
