Conditional independence and chain event graphs

DOI10.1016/j.artint.2007.05.004zbMath1182.68303OpenAlexW2118870114MaRDI QIDQ110201

Jim Q. Smith, Paul E. Anderson, Paul E. Anderson, James Q. Smith

Publication date: January 2008

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2007.05.004

Mathematics Subject Classification ID

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

Related Items

Staged tree models with toric structure ⋮ A Differential Approach for Staged Trees ⋮ Learning recursive probability trees from probabilistic potentials ⋮ A new characterization of discrete decomposable graphical models ⋮ Modelling discrete longitudinal data using acyclic probabilistic finite automata ⋮ Causal effect identification in acyclic directed mixed graphs and gated models ⋮ Algebraic structures in statistical methodology. Abstracts from the workshop held December 4--10, 2022 ⋮ The YODO algorithm: an efficient computational framework for sensitivity analysis in Bayesian networks ⋮ Toric and Non-toric Bayesian Networks ⋮ Towards a Bayesian Analysis of Migration Pathways Using Chain Event Graphs of Agent Based Models ⋮ Algorithms for learning parsimonious context trees ⋮ Chain event graphs for informed missingness ⋮ Gated Bayesian networks for algorithmic trading ⋮ The role of local partial independence in learning of Bayesian networks ⋮ Families of polytopes with rational linear precision in higher dimensions ⋮ Coherent combination of probabilistic outputs for group decision making: an algebraic approach ⋮ Equivalence classes of staged trees ⋮ Discrete statistical models with rational maximum likelihood estimator ⋮ Bayesian MAP model selection of chain event graphs ⋮ Discovery of statistical equivalence classes using computer algebra ⋮ A New Method for tackling Asymmetric Decision Problems ⋮ Causal analysis with chain event graphs ⋮ Causal discovery through MAP selection of stratified chain event graphs ⋮ Formulating Asymmetric Decision Problems as Decision Circuits ⋮ Equations defining probability tree models ⋮ Sensitivity analysis in multilinear probabilistic models ⋮ The dynamic chain event graph ⋮ Sensitivity analysis beyond linearity ⋮ Context-specific graphical models for discrete longitudinal data ⋮ stagedtrees ⋮ Customized structural elicitation ⋮ A geometric characterization of sensitivity analysis in monomial models ⋮ Refining a Bayesian network using a chain event graph ⋮ Bayesian decision support for complex systems with many distributed experts

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks, capacity and percolation on trees
• Causation, prediction, and search
• Influence diagrams for statistical modelling
• A new understanding of subjective probability and its generalization to lower and upper prevision.
• Statistics and causal inference: A review. (With discussion)
• Probabilistic Risk Analysis
• Graph-Based Algorithms for Boolean Function Manipulation
• Labelled Graphical Models
• Statistical Inference in Context Specific Interaction Models for Contingency Tables
• PROBABILISTIC DECISION GRAPHS — COMBINING VERIFICATION AND AI TECHNIQUES FOR PROBABILISTIC INFERENCE