Inference in directed evidential networks based on the transferable belief model

DOI10.1016/j.ijar.2008.01.002zbMath1185.68700OpenAlexW2091343128MaRDI QIDQ2270405

Khaled Mellouli, Boutheina Ben Yaghlane

Publication date: 18 March 2010

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

Full work available at URL: https://doi.org/10.1016/j.ijar.2008.01.002

zbMATH Keywords

belief functionsconditional belief functionsbinary join treedirected evidential networks

Mathematics Subject Classification ID

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

Related Items

Bayesian Networks vs. Evidential Networks: An Application to Convoy Detection, Learning Structure in Evidential Networks from Evidential DataBases, On conditional belief functions in directed graphical models in the Dempster-Shafer theory, Causal Belief Inference in Multiply Connected Networks, Compositional models and conditional independence in evidence theory, Independence concepts in evidence theory, Representing Interventional Knowledge in Causal Belief Networks: Uncertain Conditional Distributions Per Cause, Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm, Dynamic Directed Evidential Networks with Conditional Belief Functions: Application to System Reliability, Handling Interventions with Uncertain Consequences in Belief Causal Networks, Dealing with external actions in belief causal networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propagating belief functions in qualitative Markov trees
• Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
• The transferable belief model
• Belief function independence: I. The marginal case
• Belief function independence. II: The conditional case.
• Resource bounded and anytime approximation of belief function computations.
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence
• An axiomatic framework for propagating uncertainty in directed acyclic networks
• On the plausibility transformation method for translating belief function models to probability models
• INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH
• Independency relationships and learning algorithms for singly connected networks
• Upper and Lower Probabilities Induced by a Multivalued Mapping
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty