Learning Bayesian network equivalence classes from incomplete data

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

Volumn 4265 LNAI, Issue , 2006, Pages 291-295

  Borchani, Hanen ^a   Ben Amor, Nahla ^a   Mellouli, Khaled ^a  

^a UNIVERSITÉ DE TUNIS   (Tunisia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; EQUIVALENCE CLASSES; EVALUATION; MATHEMATICAL MODELS; OPTIMIZATION;

BAYESIAN INFORMATION CRITERION (BIC); GES ALGORITHMS; INCOMPLETE DATA; LEARNING BAYESIAN NETWORKS;

LEARNING SYSTEMS;

EID: 33750727071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11893318_29     Document Type: Conference Paper

References (16)

1. S. A. Andersson, D. Madigan, and M. D. Perlman. A characterization of Markov equivalence classes for acyclic digraphs. Annals of Statistics, 25:505-541, 1997.
2. J. Binder, D. Koller, S. Russell and K. Kanazawa. Adaptive probabilistic networks with hidden variables. Machine Learning, 29:213-244, 1997.
3. D. M. Chickering. Optimal Structure Identification With Greedy Search. Journal of Machine Learning Research, pages 507-554, 2002.
4. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incompete data via the EM algorithm. Journal of the Royal Statistical Society, B39:l-38, 1977.
5. D. Dor and M. Tarsi. A simple algorithm to construct a consistent extension of a partially oriented graph. Tech. Rep. R-185, Cognitive Systems Laboratory, 1992.
6. O. François and P. Leray. Bayesian network structural learning and incomplete data. International and Interdisciplinary conference on AKRR, Espo, Finland, 2005.
7. N. Friedman. Learning belief networks in the presence of missing values and hidden variables. In 14th Conference of Machine Learning, 1997.
8. F. V. Jensen. An Introduction to Bayesian Networks. UCL Press, London, 1996.
9. S. L. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, 50(2):157-224, 1988.
10. M. Meila and M. I. Jordan. Estimating dependency structure as a hidden variable. In NIPS 10, 1998.
11. R. M. Neal, G. E. Hinton. A View of the EM algorithm that justifies incremental sparse and other variants. Learning in Graphical Models, 1998.
12. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible inference. Morgan Kaufmann Publishers, San Francisco (California), 1988.
13. D. Rubin. Inference and missing data. Biometrika, 63:581-592, 1976.
14. M. Singh. Learning Bayesian networks from incomplete data. In AAAI97, 1997.
15. D. J. Spiegelhalter and S. L. Lauritzen. Sequential updating of conditional probabilities on directed graphical structures. Networks, 20:579-605, 1990.
16. T. Verma and J. Pearl. Equivalence and synthesis of causal models. In Proceedings of the Sixth Conference on UAI, Morgan Kaufmann Publishers, 1990.