Every LWF and AMP chain graph originates from a set of causal models

DOI10.1007/978-3-319-20807-7_29MaRDI QIDQ3451190zbMATH OpenOpenAlexFDO

Authors Jose M. Peña

Publication date 10 November 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.2967

Mathematics Subject Classification ID

Probabilistic graphical models (62H22)

Abstract: This paper aims at justifying LWF and AMP chain graphs by showing that they do not represent arbitrary independence models. Specifically, we show that every chain graph is inclusion optimal wrt the intersection of the independence models represented by a set of directed and acyclic graphs under conditioning. This implies that the independence model represented by the chain graph can be accounted for by a set of causal models that are subject to selection bias, which in turn can be accounted for by a system that switches between different regimes or configurations.

Recommendations

• Marginalization and conditioning for LWF chain graphs
• Chain Graph Models and their Causal Interpretations
• Marginal AMP chain graphs
• Characterizing Markov equivalence classes for AMP chain graph models
• Learning marginal AMP chain graphs under faithfulness

Cites work

• scientific article; zbMATH DE number 992990 (Why is no real title available?)
• scientific article; zbMATH DE number 4174001 (Why is no real title available?)
• scientific article; zbMATH DE number 1222287 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 1493045 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• scientific article; zbMATH DE number 3288322 (Why is no real title available?)
• Alternative Markov properties for chain graphs
• An application of formal argumentation: fusing Bayesian networks in multi-agent systems
• Ancestral graph Markov models.
• Chain Graph Models and their Causal Interpretations
• Chain graph interpretations and their relations
• Democraticop: a democratic way of aggregating Bayesian network parameters
• Discrete chain graph models
• Faithfulness in chain graphs: the discrete case
• Finding consensus Bayesian network structures
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Lehrer and the consensus proposal
• Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
• Marginal AMP chain graphs
• Markov properties for mixed graphs
• On chain graph models for description of conditional independence structures
• Qualitative combination of Bayesian networks
• Separation and completeness properties for AMP chain graph Markov models.
• Temporal aggregation in chain graph models

Cited in

(2)

• AMP chain graphs: minimal separators and structure learning algorithms
• Gated Bayesian networks for algorithmic trading

This page was built for publication: Every LWF and AMP chain graph originates from a set of causal models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451190)