A recovery algorithm for chain graphs

Abstract The class of chain graphs ( CGs ) involving both undirected graphs (=Markov networks) and directed acyclic graphs (=Bayesian networks) was introduced in middle eighties for description of probabilistic conditional independence structures. Every class of Markov equivalent CGs (that is, CGs describing the same conditional independence structure) has a natural representative, which is called the largest CG. The paper presents a recovery algorithm, which on the basis of the conditional independence structure given by a CG (in the form of a dependency model) finds the largest CG representing the corresponding class of Markov equivalent CGs . As a byproduct a graphical characterization of graphs which are the largest CGs (for a class of Markov equivalent CGs ) is obtained and a simple algorithm changing every CG into the largest CG of the corresponding equivalence class is given.

[1]  M. Frydenberg.  The chain graph Markov property , 1990 .

[2]  J. N. R. Jeffers,et al.  Graphical Models in Applied Multivariate Statistics. , 1990 .

[3]  N. Wermuth,et al.  Graphical Models for Associations between Variables, some of which are Qualitative and some Quantitative , 1989 .

[4]  J. Pearl,et al.  Logical and Algorithmic Properties of Conditional Independence and Graphical Models , 1993 .

[5]  M. Studený,et al.  On chain graph models for description of conditional independence structures , 1998 .

[6]  Dan Geiger,et al.  On the logic of causal models , 2013, UAI.

[7]  M. Frydenberg.  Marginalization and Collapsibility in Graphical Interaction Models , 1990 .

[8]  Milan Studený,et al.  Chain graphs: semantics and expressiveness , 1995, ECSQARU.

[9]  David Maxwell Chickering,et al.  A Transformational Characterization of Equivalent Bayesian Network Structures , 1995, UAI.

[10]  L. N. Kanal,et al.  Uncertainty in Artificial Intelligence 5 , 1990 .

[11]  Dan Geiger,et al.  On Testing Whether an Embedded Bayesian Network Represents a Probability Model , 1994, UAI.

[12]  A. P. Dawid,et al.  Independence properties of directed Markov fields. Networks, 20, 491-505 , 1990 .

[13]  R. Bouckaert.  Bayesian belief networks : from construction to inference , 1995 .

[14]  Judea Pearl,et al.  Equivalence and Synthesis of Causal Models , 1990, UAI.

[15]  Steffen L. Lauritzen,et al.  Independence properties of directed markov fields , 1990, Networks.

[16]  Christopher Meek,et al.  Causal inference and causal explanation with background knowledge , 1995, UAI.

[17]  Milan Studený.  On Separation Criterion and Recovery Algorithm for Chain Graphs , 1996, UAI.

[18]  Judea Pearl,et al.  Causal networks: semantics and expressiveness , 2013, UAI.

[19]  Judea Pearl,et al.  An Algorithm for Deciding if a Set of Observed Independencies Has a Causal Explanation , 1992, UAI.

[20]  S. Lauritzen,et al.  Mixed graphical association models; discussions and reply , 1989 .

[21]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[22]  D. Madigan,et al.  A characterization of Markov equivalence classes for acyclic digraphs , 1997 .

[23]  Nanny Wermuth,et al.  Multivariate Dependencies: Models, Analysis and Interpretation , 1996 .

[24]  Wray L. Buntine.  Chain graphs for learning , 1995, UAI.