A hybrid methodology for learning belief networks: BENEDICT

International Journal of Approximate Reasoning

Volumn 27, Issue 3, 2001, Pages 235-262

  Acid, Silvia ^a   De Campos, Luis M ^a  

^a UNIVERSITY OF GRANADA   (Spain)

Author keywords

Belief networks; Independence; Learning; Minimum d separating sets; Scoring metrics

Indexed keywords

EID: 0035452682     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0888-613X(01)00041-X     Document Type: Article

References (44)

1. S. Acid, Métodos de aprendizaje de redes de creencia. Aplicación a la clasificación, Ph.D. thesis, Universidad de Granada, Spain, 1999 (in Spanish).
2. S. Acid, L.M. de Campos, An algorithm for finding minimum d-separating sets in belief networks, in: E. Horvitz, F. Jensen (Eds.), Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Mateo, 1996, pp. 3-10.
3. S. Acid, L.M. de Campos, An algorithm for finding minimum d-separating sets in belief networks, Decsai Technical Report 960214, Universidad de Granada, 1996, pp. 1-22.
4. S. Acid, L.M. de Campos, Benedict: an algorithm for learning probabilistic belief networks, in: Proceedings of the Sixth IPMU Conference, 1996, pp. 979-984.
5. S. Acid, L.M. de Campos, A. González, R. Molina, N. Pérez De La Blanca, Learning with castle, in: R. Kruse, P. Siegel (Eds.), Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Lecture Notes in Computer Science 548, Springer, Berlin, 1991, pp. 99-106.
6. I.A. Beinlich, H.J. Suermondt, R.M. Chavez, G.F. Cooper, The alarm monitoring system: A case study with two probabilistic inference techniques for belief networks, in: European Conference on Artificial Intelligence in Medicine, 1989, pp. 247-256.
7. R. Bouckaert, Optimizing causal orderings for generating dags from data, in: D. Dubois, M.P. Wellman, D.B. D'Ambrosio (Eds.), Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence, Morgan-Kaufmann, San Mateo, 1992, pp. 9-16.
8. R.R. Bouckaert, Belief networks construction using the minimum description length principle. in: M. Clarke, R. Kruse, S. Moral (Eds.), Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Lecture Notes in Computer Science 747, Springer, Berlin, 1993, pp. 41-48.
9. L. Breiman, J.H. Friedman, R.A. Olshen, C.J. Stone, Classification and Regression Trees, Wadsworth Statistics Probability Series, Belmont, 1984.
10. Buntine W. Operations for learning with graphical models. Journal of Artificial Intelligence Research. 2:1994;159-225.
11. Buntine W. A guide to the literature on learning probabilistic networks from data. IEEE Transactions on Knowledge and Data Engineering. 8:1996;195-210.
12. de Campos L.M. Independency relationships and learning algorithms for singly connected networks. Journal of Experimental and Theoretical Artificial Intelligence. 10(4):1998;511-549.
13. de Campos L.M., Huete J.F. On the use of independence relationships for learning simplified belief networks. International Journal of Intelligent Systems. 12:1997;495-522.
14. de Campos L.M., Huete J.F. Aproximación de una ordenación de variables en redes causales mediante algoritmos genéticos. Inteligencia Artificial. 4:1998;30-39. (in Spanish).
15. de Campos L.M., Huete J.F. A new approach for learning belief networks using independence criteria. International Journal of Approximate Reasoning. 24:2000;11-37.
16. L.M. de Campos, J.F. Huete, Approximating causal orderings for Bayesian networks using genetic algorithms and simulated annealing, in: Proceedings of the Eighth IPMU Conference, vol. I, 2000, pp. 333-340.
17. J. Cheng, D.A. Bell, W. Liu, An algorithm for Bayesian belief network construction from data, in: Proceedings of AI and STAT'97, 1997, pp. 83-90.
18. Chow C., Liu C. Approximating discrete probability distributions with dependence trees. IEEE transactions on Information Theory. 14:1968;462-467.
19. Cooper G.F., Herskovits E. A Bayesian method for the induction of probabilistic networks from data. Machine Learning. 9(4):1992;309-348.
20. Ford L.R., Fulkerson D.R. Flows in Networks. 1962;Princeton University Press, Princeton, NJ.
21. N. Friedman, M. Goldszmidt, Learning Bayesian networks with local structure. in: E. Horvitz, F. Jensen (Eds.), Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Mateo, 1996, pp. 252-262.
22. D. Geiger, D. Heckerman, A characterisation of the Dirichlet distribution with application to learning Bayesian networks, in: P. Besnard, S. Hanks (Eds.) Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, Morgan and Kaufmann, San Francisco, 1995, pp. 196-207.
23. D. Geiger, A. Paz, J. Pearl, Learning causal trees from dependence information. in: Eighth National Conference on Artificial Intelligence (AAAI 90), 1990, pp. 770-776.
24. Geiger D., Paz A., Pearl J. Learning simple causal structures. International Journal of Intelligent Systems. 8:1993;231-247.
25. Heckerman D. Bayesian networks for knowledge discovery. Fayyad U.M., Piatetsky-Shapiro G., Smyth P., Uthurusamy R. Advances in Knowledge Discovery and Data Mining. 1996;273-305 MIT Press, Cambridge, MA.
26. Heckerman D., Geiger D., Chickering D.M. Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning. 20:1995;197-243.
27. E. Herskovits, G.F. Cooper, Kutató: An entropy-driven system for the construction of probabilistic expert systems from databases, in: P. Bonissone (Ed.), Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, Cambridge, 1990, pp. 54-62.
28. E.H. Herskovits, Computer-based probabilistic networks construction, Ph.D. thesis, Medical Information Sciences, Stanford University, 1991.
29. J.F. Huete, L.M. de Campos, Learning causal polytrees, in: M. Clarke, R. Kruse, S. Moral (Eds.), Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Lecture Notes in Computer Science 747, Springer, Berlin, 1993, pp. 180-185.
30. Kullback S., Leibler R.A. On information and sufficiency. Annals of Mathematical Statistics. 22:1951;79-86.
31. Kullback S. Information Theory and Statistics. 1968;Dover Publication, New York.
32. Lauritzen S.L. Lectures on Contingency Tables. 1982;U. Aalborg Press, Aalborg, Denmark.
33. Madigan D., Rafterym A. Model selection and accounting for model uncertainty in graphical models using Occam's window. Journal of the American Statistics Association. 89:1994;1535-1546.
34. J. Pearl, A. Paz, Graphoids: A graph-based logic for reasoning about relevance relations, Technical Report 850038 (R-53-L), Cognitive Systems Laboratory, UCLA, 1985.
35. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Morgan Kaufmann. 1988;Morgan Kaufmann, San Mateo.
36. M. Ramoni, P. Sebastiani, Learning Bayesian networks from incomplete databases, in: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, Morgan and Kaufman, San Mateo, 1997, pp. 401-408.
37. G. Rebane, J. Pearl, The recovery of causal poly-trees from statistical data, in: L.N. Kanal, T.S. Levitt, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence, vol. 3, 1987, pp. 222-228.
38. M. Singh, M. Valtorta, An algorithm for the construction of Bayesian network structures from data, in: D. Heckerman, A. Mamdani (Eds.), Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, 1993, pp. 259-265.
39. Singh M., Valtorta M. Construction of Bayesian network structures from data: a brief survey and an efficient algorithm. International Journal of Approximate Reasoning. 12:1995;111-131.
40. P. Spirtes, C. Glymour, R. Scheines, Causation, Prediction and Search, Lecture Notes in Statistics 81, Springer, New York, 1993.
41. S. Srinivas, S. Russell, A. Agogino, Automated construction of sparse Bayesian networks from unstructured probabilistic models and domain information, in: M. Henrion, R.D. Shachter, L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence, vol. 5, North-Holland, Amsterdam, 1990, pp. 295-308.
42. J. Suzuki, A construction of Bayesian networks from databases based on the MDL principle, in: D. Heckerman, A. Mamdani (Eds.) Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, 1993, pp. 266-273.
43. T. Verma, J. Pearl, Causal networks: Semantics and expressiveness. in: R.D. Shachter, T.S. Lewitt, L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence, vol. 4, North-Holland, Amsterdam, 1990, pp. 69-76.
44. Wermuth N., Lauritzen S. Graphical and recursive models for contingence tables. Biometrika. 72:1983;537-552.