Constrained score+(local)search methods for learning Bayesian networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3571 LNAI, Issue , 2005, Pages 161-173

  Gámez, José A ^a   Puerta, J Miguel ^a  

^a UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS;

BAYESIAN NETWORKS; CONSTRAINED SCORE+(LOCAL)SEARCH METHODS; CPU REQUIREMENTS; HILL CLIMBING;

SEARCH ENGINES;

EID: 26944474379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11518655_15     Document Type: Conference Paper

References (17)

1. S. Acid and L.M. de Campos. A hybrid methodology for learning belief networks: Benedict. International. Journal of Approximate Reasoning, 27(3):235-262, 2001.
2. S. Acid and L.M. de Campos. Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs. Journal of Artificial Intelligence Research, 18:445-490, 2003.
3. I.A, Beinlich, H.J. Suermondt, R.M. Chavez, and G.F. Cooper. The ALARM monitoring system: A case study with two probabilistic inference techniques for belief networks. In Proc. of the 2nd European Conf. on Artificial Intelligence in Medicine, 247-256, 1989.
4. J. Binder, D. Koller, S. Russell, and K. Kanazawa. Adaptive probabilistic networks with hidden variables. Machine Learning, 29(2):213-244, 1997.
5. W. Buntine. Theory refinement of Bayesian networks. In Proc. of the 7th Conf. on Uncertainty in Artificial Intelligence, 52-60, 1991.
6. L.M. de Campos, J.M. Fernández-Luna, J.A. Gámez, and J.M. Puerta. Ant colony optimization for learning Bayesian networks. International Journal of Approximate Reasoning, 31:291-311, 2002.
7. L.M. de Campos and J.M. Puerta. Stochastic local and distributed search algorithms for learning belief networks. In Proc. of 3rd Int. Symp. on Adaptive Systems: Evolutionary Computation and Probabilistic Graphical Model, 109-115, 2001.
8. L.M. de Campos and J.M. Puerta. Stochastic local search algorithms for learning belief networks: Searching in the space of orderings. LNAI, 2143:228-239, 2001.
9. D.M. Chickering. Optimal structure identification with greedy search. Journal of Machine Learning Research, 3:507-554, 2002.
10. D.M. Chickering, D. Geiger, and D. Heckerman. Learning Bayesian networks is NP-Complete. In D. Fisher and H. Lenz, Eds., Learning from Data: Artificial Intelligence and Statistics V, Springer-Verlag, 121-130, 1996.
11. N. Friedman, I. Nachman and D. Per. Learning Bayesian networks from massive datasets: The "sparse candidate" algorithm. In Proc. of the 15th Conf. on Uncertainty in Artificial Intelligence, 201-210, 1999.
12. D. Heckerman, D. Geiger, and D.M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20:197-244, 1995.
13. F.V. Jensen. Bayesian Networks and Decision Graphs. Springer Verlag, 2001.
14. R. Neapolitan. Learning Bayesian Networks. Prentice Hall, 2003.
15. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, 1988.
16. P. Spirtes, C. Glymour, and R. Scheines. Causation, Prediction, and Search. Lecture Notes in Statistics 81, Springer Verlag, 1993.
17. T. Verma and J. Pearl. Equivalence and synthesis of causal models. In Proc. of the 6th Conf. on Uncertainty in Artificial Intelligence, pages 220-227, 1991.