Marginal AMP chain graphs
From MaRDI portal
Publication:2447777
DOI10.1016/J.IJAR.2014.03.003zbMATH Open1433.05304arXiv1305.0751OpenAlexW2963315530MaRDI QIDQ2447777FDOQ2447777
Authors: Jose M. Peña 
Publication date: 29 April 2014
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Abstract: We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not only subsume AMP chain graphs but also multivariate regression chain graphs. We describe global and pairwise Markov properties for MAMP chain graphs and prove their equivalence for compositional graphoids. We also characterize when two MAMP chain graphs are Markov equivalent. For Gaussian probability distributions, we also show that every MAMP chain graph is Markov equivalent to some directed and acyclic graph with deterministic nodes under marginalization and conditioning on some of its nodes. This is important because it implies that the independence model represented by a MAMP chain graph can be accounted for by some data generating process that is partially observed and has selection bias. Finally, we modify MAMP chain graphs so that they are closed under marginalization for Gaussian probability distributions. This is a desirable feature because it guarantees parsimonious models under marginalization.
Full work available at URL: https://arxiv.org/abs/1305.0751
Recommendations
- Learning marginal AMP chain graphs under faithfulness revisited
- Learning marginal AMP chain graphs under faithfulness
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- Characterizing Markov equivalence classes for AMP chain graph models
- Alternative Markov properties for chain graphs
Cites Work
- Pattern recognition and machine learning.
- Title not available (Why is that?)
- Ancestral graph Markov models.
- Title not available (Why is that?)
- Identifying independence in bayesian networks
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Marginalizing and conditioning in graphical models
- Title not available (Why is that?)
- Stable mixed graphs
- Alternative Markov properties for chain graphs
- Discrete chain graph models
- Markov properties for mixed graphs
- Separation and completeness properties for AMP chain graph Markov models.
- Title not available (Why is that?)
- Markov properties for linear causal models with correlated errors
- Chain graph interpretations and their relations
- Marginal Log-Linear Parameters for Graphical Markov Models
Cited In (15)
- AMP chain graphs: minimal separators and structure learning algorithms
- Unifying Markov properties for graphical models
- Faithfulness of probability distributions and graphs
- On a hypergraph probabilistic graphical model
- Title not available (Why is that?)
- Marginalization and conditioning for LWF chain graphs
- Learning marginal AMP chain graphs under faithfulness revisited
- Causal effect identification in acyclic directed mixed graphs and gated models
- Factorization, inference and parameter learning in discrete AMP chain graphs
- Learning marginal AMP chain graphs under faithfulness
- On expressiveness of the AMP chain graph interpretation
- Every LWF and AMP chain graph originates from a set of causal models
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- Alternative Markov properties for chain graphs
- Phoretic self-propulsion of a slightly inhomogeneous disc
Uses Software
This page was built for publication: Marginal AMP chain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447777)
