Local computations in Dempster-Shafer theory of evidence

DOI10.1016/j.ijar.2012.06.012zbMath1266.68177OpenAlexW1965522271MaRDI QIDQ2375319

Radim Jiroušek

Publication date: 13 June 2013

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

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

zbMATH Keywords

computational complexityfactorisationcomposition operatorconditional independencegraphical modelbelief network

Mathematics Subject Classification ID

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

Related Items (5)

Marginalization in models generated by compositional expressions ⋮ Brief Introduction to Probabilistic Compositional Models ⋮ Unnamed Item ⋮ Compositional models in valuation-based systems ⋮ Decomposition integrals

Cites Work

• Compositional models and conditional independence in evidence theory
• Uncertain evidence and artificial analysis
• Markov fields and log-linear interaction models for contingency tables
• Towards a frequentist theory of upper and lower probability
• Conditional independence in valuation-based systems
• Belief function independence: I. The marginal case
• Belief function independence. II: The conditional case.
• On stochastic conditional independence: The problems of characterization and description
• On the Desirability of Acyclic Database Schemes
• A fast procedure for model search in multidimensional contingency tables
• Upper and Lower Probabilities Induced by a Multivalued Mapping
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local computations in Dempster-Shafer theory of evidence