Approximate inference in directed evidential networks with conditional belief functions using the Monte Carlo algorithm
From MaRDI portal
Publication:5227401
Recommendations
Cites work
- scientific article; zbMATH DE number 1665314 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- 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
- Binary join trees for computing marginals in the Shenoy-Shafer architecture
- Credal networks
- Dempster's rule of combination is {\#}P-complete
- How to randomly generate mass functions
- Implementing Dempster's rule for hierarchical evidence
- Inference in directed evidential networks based on the transferable belief model
- Propagating belief functions in qualitative Markov trees
- The transferable belief model
Cited in
(7)- Dynamic directed evidential networks with conditional belief functions: application to system reliability
- Reliability inference method for evidential network based on the clique tree propagation algorithm
- Bayesian network reasoning with uncertain evidences
- Learning structure in evidential networks from evidential databases
- Directed evidential networks with conditional belief functions
- Inference in directed evidential networks based on the transferable belief model
- Parameters learning in evidential network deducing using unite-believe value
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)