Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm

DOI10.1007/978-3-319-08852-5_50zbMath1415.68233OpenAlexW2285876813MaRDI QIDQ5227401

Boutheina Ben Yaghlane, Wafa Laâmari, Narjes Ben Hariz

Publication date: 26 July 2019

Published in: Information Processing and Management of Uncertainty in Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08852-5_50

zbMATH Keywords

Monte Carlo algorithmevidence theorybelief functionmass functionfocal element

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implementing Dempster's rule for hierarchical evidence
• Propagating belief functions in qualitative Markov trees
• The transferable belief model
• Credal networks
• 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
• Inference in directed evidential networks based on the transferable belief model
• Dempster's rule of combination is {\#}P-complete
• HOW TO RANDOMLY GENERATE MASS FUNCTIONS
• A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective

This page was built for publication: Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm