Resource bounded and anytime approximation of belief function computations.

DOI10.1016/S0888-613X(02)00074-9zbMath1033.68116MaRDI QIDQ1399499

Rolf Haenni, Norbert Lehmann

Publication date: 30 July 2003

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

Dempster-Shafer theoryincompletenessfusion algorithmjoin tree propagationlower and upper approximationBelief functionsinterruptible anytime algorithm

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (8)

Ordered valuation algebras: A generic framework for approximating inference ⋮ Geometry of relative plausibility and relative belief of singletons ⋮ Making inferences in incomplete Bayesian networks: a Dempster-Shafer belief function approach ⋮ Computing the decomposable entropy of belief-function graphical models ⋮ On the Orthogonal Projection of a Belief Function ⋮ On the relative belief transform ⋮ Inference in directed evidential networks based on the transferable belief model ⋮ The Intersection Probability and Its Properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consonant approximations of belief functions
• Propagating belief functions in qualitative Markov trees
• Uncertain evidence and artificial analysis
• 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
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
• A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence
• Bucket elimination: A unifying framework for reasoning
• 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: a new perspective on the dempster-shafer theory
• A computationally efficient approximation of Dempster-Shafer theory
• Propositional information systems
• Upper and Lower Probabilities Induced by a Multivalued Mapping

This page was built for publication: Resource bounded and anytime approximation of belief function computations.