The search of causal orderings: A short cut for learning belief networks

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2143, Issue , 2001, Pages 216-227

  Acid, Silvia ^a   De Campos, Luis M ^a   Huete, Juan F ^a  

^a UNIVERSITY OF GRANADA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BAYESIAN NETWORKS;

CAUSAL ORDER; CAUSAL ORDERING; CONDITIONAL INDEPENDENCES; SEARCH SPACES;

LEARNING ALGORITHMS;

EID: 84937406090     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44652-4_20     Document Type: Conference Paper

References (18)

1. S. Acid and L.M. de Campos. An algorithm for finding minimum d-separating sets in belief networks. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, E. Horvitz, F. Jensen (Eds.), pages 3-10 Morgan and Kaufmann, 1996.
2. S. Acid and L.M. de Campos. Benedict: An algorithm for learning probabilistic belief netwoks. In Proceedings of Information Processing and Management of Uncertainty in Knowledge-Based Systems, pages 979-984, 1996.
3. S. Acid and L.M. de Campos. An hybrid methodology for learning belief networks: Benedict. To appear in International Journal of Approximate Reasoning.
4. N. Ansari and E. Hou. Computational Intelligence for Optimization. Kluwer Academic Publishers, 1997.
5. I. Beinlich, H. Seurmondt, R. Chavez, and G. Cooper. The alarm monitoring system: A case study with two probabilistic inference techniques for belief networks. In Proceedings of the Second European Conference on Artificial Intelligence in Medicine, pages 247-256, 1989.
6. R. Bouckaert. Optimizing causal orderings for generating dag's from data. In Proc. Conf. on Uncertainty in Artificial Intelligence, pages 9-16. Morgan-Kaufmann, 1992.
7. W. Buntine. A guide to the literature on learning probabilistic networks from data. IEEE Transaction on Knowledge and Data Engineering, 8:195-210, 1996.
8. L.M. de Campos. Independency relationships and learning algorithms for singly connected networks. Journal of Experimental and Theoretical Artificial Intelligence 10:511-549, 1998.
9. L.M. de Campos and J.F. Huete. On the use of independence relationships for learning simplified belief networks. Int. J. of Intelligent Systems, 12:495-522, 1997.
10. L.M. de Campos and J.F. Huete. A new approach for learning belief networks using independence criteria. International Journal of Approximate Reasoning, 24(1)11- 37, 2000.
11. J. Cheng, D.A. Bell and W. Liu. Learning belief networks form data: An information theory based approach In Proc. of ACM CIKM'97, pages 325-331, 1997.
12. D. Chickering, D. Geiger, and D. Heckerman. Learning Bayesian Networks is nphard. Technical Report MSR-TR-94-17, Microsoft Research, 1994.
13. G.F. Cooper and E. Herskovits. A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309-347, 1992.
14. P. Larranaga, C.M. Kuijpers, R.H. Murga, and Y. Yurramendi. Learning Bayesian network structure by searching for the best ordering with genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics- Part A: Systems and Humans, 26(4):487-493, 1996.
15. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan and Kaufmann, 1988.
16. P. Spirtes, C. Glymour, and R. Scheines. Causation, Prediction and Search. Lecture Notes in Statistics 81. Springer Verlag, New York, 1993.
17. M. Singh and M. Valtorta. Construction of Bayesian networks structures from data: A survey and an efficient algorithm. International Journal of Approximate Reasoning, 12:111-131, 1995.
18. T. Verma and J. Pearl. Equivalence and synthesis of causal models. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, pages 220-227, Mass, 1990.