Compositional models and conditional independence in evidence theory
From MaRDI portal
Publication:553965
DOI10.1016/j.ijar.2010.02.005zbMath1217.68214OpenAlexW2105753516MaRDI QIDQ553965
Radim Jiroušek, Jiřina Vejnarová
Publication date: 29 July 2011
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2010.02.005
Related Items (8)
Approximation of Data by Decomposable Belief Models ⋮ Local computations in Dempster-Shafer theory of evidence ⋮ Unnamed Item ⋮ Compositional models for credal sets ⋮ Acyclic directed graphs representing independence models ⋮ Recursive estimation of high-order Markov chains: approximation by finite mixtures ⋮ Evidential Networks from a Different Perspective ⋮ Probabilistic compositional models: solution of an equivalence problem
Cites Work
- Computing lower and upper expectations under epistemic independence
- Combination of partially non-distinct beliefs: the cautious-adaptive rule
- Conditional independence structure and its closure: inferential rules and algorithms
- I-divergence geometry of probability distributions and minimization problems
- Belief function independence. II: The conditional case.
- Strong conditional independence for credal sets
- Binary join trees for computing marginals in the Shenoy-Shafer architecture
- Inference in directed evidential networks based on the transferable belief model
- Conjunctive and disjunctive combination of belief functions induced by nondistinct bodies of evidence
- On the Desirability of Acyclic Database Schemes
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Compositional models and conditional independence in evidence theory
