Approximate inference in directed evidential networks with conditional belief functions using the Monte Carlo algorithm
From MaRDI portal
Publication:5227401
DOI10.1007/978-3-319-08852-5_50zbMATH Open1415.68233OpenAlexW2285876813MaRDI QIDQ5227401FDOQ5227401
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The transferable belief model
- HOW TO RANDOMLY GENERATE MASS FUNCTIONS
- Implementing Dempster's rule for hierarchical evidence
- Propagating belief functions in qualitative Markov trees
- A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence
- A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
- Credal networks
- Binary join trees for computing marginals in the Shenoy-Shafer architecture
- Title not available (Why is that?)
- Inference in directed evidential networks based on the transferable belief model
- Dempster's rule of combination is {\#}P-complete
Cited In (2)
This page was built for publication: Approximate inference in directed evidential networks with conditional belief functions using the Monte Carlo algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227401)