Learning AMP Chain Graphs and some Marginal Models Thereof under Faithfulness: Extended Version

03/04/2013
by   Jose M. Peña, et al.
0

This paper deals with chain graphs under the Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. Moreover, we show that the extension of Meek's conjecture to AMP chain graphs does not hold, which compromises the development of efficient and correct score+search learning algorithms under assumptions weaker than faithfulness. We also introduce a new family of graphical models that consists of undirected and bidirected edges. We name this new family maximal covariance-concentration graphs (MCCGs) because it includes both covariance and concentration graphs as subfamilies. However, every MCCG can be seen as the result of marginalizing out some nodes in an AMP CG. We describe global, local and pairwise Markov properties for MCCGs and prove their equivalence. We characterize when two MCCGs are Markov equivalent, and show that every Markov equivalence class of MCCGs has a distinguished member. We present a constraint based algorithm for learning a MCCG a given probability distribution is faithful to. Finally, we present a graphical criterion for reading dependencies from a MCCG of a probability distribution that satisfies the graphoid properties, weak transitivity and composition. We prove that the criterion is sound and complete in certain sense.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2012

Learning AMP Chain Graphs under Faithfulness

This paper deals with chain graphs under the alternative Andersson-Madig...
research
10/21/2010

Reading Dependencies from Covariance Graphs

The covariance graph (aka bi-directed graph) of a probability distributi...
research
08/29/2017

Unifying DAGs and UGs

We introduce a new class of graphical models that generalizes Lauritzen-...
research
06/20/2012

Reading Dependencies from Polytree-Like Bayesian Networks

We present a graphical criterion for reading dependencies from the minim...
research
05/29/2020

Learning LWF Chain Graphs: A Markov Blanket Discovery Approach

This paper provides a graphical characterization of Markov blankets in c...
research
11/11/2018

Unifying Gaussian LWF and AMP Chain Graphs to Model Interference

An intervention may have an effect on units other than those to which th...
research
05/11/2007

Determining full conditional independence by low-order conditioning

A concentration graph associated with a random vector is an undirected g...

Please sign up or login with your details

Forgot password? Click here to reset