The Search of Causal Orderings: A Short Cut for Learning Belief Networks

Although we can build a belief network starting from any ordering of its variables, its structure depends heavily on the ordering being selected: the topology of the network, and therefore the number of conditional independence relationships that may be explicitly represented can vary greatly from one ordering to another. We develop an algorithm for learning belief networks composed of two main subprocesses: (a) an algorithm that estimates a causal ordering and (b) an algorithm for learning a belief network given the previous ordering, each one working over different search spaces, the ordering and dag space respectively.

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

[2]  Judea Pearl,et al.  Chapter 2 – BAYESIAN INFERENCE , 1988 .

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

[4]  Moninder Singh,et al.  Construction of Bayesian network structures from data: A brief survey and an efficient algorithm , 1995, Int. J. Approx. Reason..

[5]  Wray L. Buntine.  A Guide to the Literature on Learning Probabilistic Networks from Data , 1996, IEEE Trans. Knowl. Data Eng..

[6]  Weiru Liu,et al.  Learning belief networks from data: an information theory based approach , 1997, CIKM '97.

[7]  Luis M. de Campos,et al.  Independency relationships and learning algorithms for singly connected networks , 1998, J. Exp. Theor. Artif. Intell..

[8]  Luis M. de Campos,et al.  A new approach for learning belief networks using independence criteria , 2000, Int. J. Approx. Reason..

[9]  Gregory F. Cooper,et al.  The ALARM Monitoring System: A Case Study with two Probabilistic Inference Techniques for Belief Networks , 1989, AIME.

[10]  Tom Burr,et al.  Causation, Prediction, and Search , 2003, Technometrics.

[11]  Nirwan Ansari,et al.  Computational Intelligence for Optimization , 1996, Springer US.

[12]  Luis M. de Campos,et al.  A hybrid methodology for learning belief networks: BENEDICT , 2001, Int. J. Approx. Reason..

[13]  J. Huete,et al.  On the use of independence relationships for learning simplified belief networks , 1997 .

[14]  Luis M. de Campos,et al.  An Algorithm for Finding Minimum d-Separating Sets in Belief Networks , 1996, UAI.

[15]  Remco R. Bouckaert,et al.  Optimizing Causal Orderings for Generating DAGs from Data , 1992, UAI.

[16]  Luis M. de Campos,et al.  On the use of independence relationships for learning simplified belief networks , 1997, Int. J. Intell. Syst..

[17]  Pedro Larrañaga,et al.  Learning Bayesian network structures by searching for the best ordering with genetic algorithms , 1996, IEEE Trans. Syst. Man Cybern. Part A.