Approximation of Data by Decomposable Belief Models

DOI10.1007/978-3-642-14055-6_5zbMath1215.68225OpenAlexW2129849110MaRDI QIDQ3163967

Radim Jiroušek

Publication date: 27 October 2010

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14055-6_5

zbMATH Keywords

decomposable modelsprobabilistic graphical Markov models

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Distances in evidence theory: comprehensive survey and generalizations
• Compositional models and conditional independence in evidence theory
• 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
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• Uncertainty and Information
• Upper and Lower Probabilities Induced by a Multivalued Mapping
• KI 2003: Advances in Artificial Intelligence