Finding P-Maps and I-Maps to Represent Conditional Independencies

The representation problem of independence models is studied by focusing on acyclic directed graph (DAG). We present the algorithm PC* in order to look for a perfect map. However, when a perfect map does not exist, so that PC* fails, it is interesting to find a minimal I--map, which represents as many triples as possible in J*. Therefore we describe an algorithm which finds such a map by means of a backtracking procedure.

[1]  Dan Wu,et al.  On the implication problem for probabilistic conditional independency , 2000, IEEE Trans. Syst. Man Cybern. Part A.

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

[3]  Barbara Vantaggi,et al.  Acyclic directed graphs representing independence models , 2011, Int. J. Approx. Reason..

[4]  Milan Studený,et al.  Racing algorithms for conditional independence inference , 2007, Int. J. Approx. Reason..

[5]  Milan Studený,et al.  Semigraphoids and structures of probabilistic conditional independence , 1997, Annals of Mathematics and Artificial Intelligence.

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

[7]  Barbara Vantaggi,et al.  Conditional independence structure and its closure: Inferential rules and algorithms , 2009, Int. J. Approx. Reason..

[8]  J. Alexander,et al.  Theory and Methods: Critical Essays in Human Geography , 2008 .

[9]  Barbara Vantaggi,et al.  An Algorithm to Find a Perfect Map for Graphoid Structures , 2010, IPMU.

[10]  David J. Spiegelhalter,et al.  Probabilistic Networks and Expert Systems , 1999, Information Science and Statistics.

[11]  P. Spirtes,et al.  Causation, prediction, and search , 1993 .

[12]  Michael Clarke,et al.  Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1991, Lecture Notes in Computer Science.

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

[14]  Milan Studeny.  Probabilistic Conditional Independence Structures: With 42 Illustrations (Information Science and Statistics) , 2004 .

[15]  Milan Studený,et al.  Probabilistic conditional independence structures , 2006, Information science and statistics.

[16]  Barbara Vantaggi,et al.  Acyclic Directed Graphs to Represent Conditional Independence Models , 2009, ECSQARU.

[17]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[18]  Constantin F. Aliferis,et al.  The max-min hill-climbing Bayesian network structure learning algorithm , 2006, Machine Learning.