Learning Bayesian Network Equivalence Classes from Incomplete Data-Reference-Cited by-同舟云学术

Learning Bayesian Network Equivalence Classes from Incomplete Data

Published:2006 Issue: Volume: Page:291-295
ISSN:0302-9743
Container-title:Discovery Science
language:
Short-container-title:

Author:

Borchani Hanen,Ben Amor Nahla,Mellouli Khaled

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11893318_29

Reference16 articles.

1. Andersson, S.A., Madigan, D., Perlman, M.D.: A characterization of Markov equivalence classes for acyclic digraphs. Annals of Statistics 25, 505–541 (1997)

2. Binder, J., Koller, D., Russell, S., Kanazawa, K.: Adaptive probabilistic networks with hidden variables. Machine Learning 29, 213–244 (1997)

3. Chickering, D.M.: Optimal Structure Identification With Greedy Search. Journal of Machine Learning Research, 507–554 (2002)

4. Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incompete data via the EM algorithm. Journal of the Royal Statistical Society B39, 1–38 (1977)

5. Dor, D., Tarsi, M.: A simple algorithm to construct a consistent extension of a partially oriented graph. Tech. Rep. R-185, Cognitive Systems Laboratory (1992)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Discovery of Causal Models that Contain Latent Variables Through Bayesian Scoring of Independence Constraints;Machine Learning and Knowledge Discovery in Databases;2017

2. A Method of Handling Missing Data in the Context of Learning Bayesian Network Structure;Applied Mechanics and Materials;2013-12

3. Learning Bayesian networks: approaches and issues;The Knowledge Engineering Review;2011-05-12

4. Learning Causal Bayesian Networks from Incomplete Observational Data and Interventions;Lecture Notes in Computer Science;2007