"Ideal parent" structure learning for continuous variable Bayesian networks

Journal of Machine Learning Research

Volumn 8, Issue , 2007, Pages 1799-1833

  Elidan, Gal ^a   Nachman, Iftach ^b   Friedman, Nir ^c  

^a Stanford University   (United States)

^b HARVARD UNIVERSITY   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Bayesian networks; Continuous variables; Hidden variables; Structure learning

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING;

AUTOMATIC LEARNING; CONTINUOUS VARIABLES; HIDDEN VARIABLES; STRUCTURE LEARNING;

BAYESIAN NETWORKS;

EID: 34548183010     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. D. M. Chickering. Learning Bayesian networks is NP-complete. In D. Fisher and H. J. Lenz, editors, Learning from Data: Artificial Intelligence and Statistics V, pages 121-130. Springer-Verlag, New York, 1996a.
2. D. M. Chickering. Learning equivalence classes of Bayesian network structures. In E. Horvitz and F. Jensen, editors, Proc. Twelfth Conference on Uncertainty in Artificial Intelligence (UAI '96), pages 150-157, San Francisco, 1996b. Morgan Kaufmann.
3. S. Della Pietra, V. Della Pietra, and J. Lafferty. Inducing features of random fields. IEEE Trans. on Pattern Analysis and Machine Intelligence, 19(4):380-393, 1997.
4. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, B 39:1-39, 1977.
5. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, New York, 1973.
6. G. Elidan and N. Friedman. The information bottleneck EM algorithm. In C. Meek and U. Kjærulff, editors, Proc. Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI '03), pages 200-208, San Francisco, 2003. Morgan Kaufmann.
7. G. Elidan, N. Lotner, N. Friedman, and D. Koller. Discovering hidden variables: A structure-based approach. In T. K. Leen, T. G. Dietterich, and V. Tresp, editors, Advances in Neural Information Processing Systems 13, pages 479-485, Cambridge, Mass., 2001. MIT Press.
8. N. Friedman. Learning belief networks in the presence of missing values and hidden variables. In D. Fisher, editor, Proc. Fourteenth International Conference on Machine Learning, pages 125-133. Morgan Kaufmann, San Francisco, 1997.
9. N. Friedman, M. Linial, I. Nachman, and D. Pe'er. Using Bayesian networks to analyze expression data. Computational Biology, 7:601-620, 2000.
10. N. Friedman, I. Nachman, and D. Pe'er. Learning Bayesian network structure from massive data sets: The 'sparse candidate" algorithm. In K. Laskey and H. Prade, editors, Proc. Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI '99), page 206-215, San Francisco, 1999.
11. A. P. Gasch, P. T. Spellman, C. M. Kao, O. Carmel-Harel, M. B. Eisen, G. Storz, D. Botstein, and P. O. Brown. Genomic expression program in the response of yeast cells to environmental changes. Molecular Biology of the Cell, 11:4241-4257, 2000.
12. D. Geiger and D. Heckerman. Learning Gaussian networks. In R. López de Mantarás and D. Poole, editors, Proc. Tenth Conference on Uncertainty in Artificial Intelligence (UAI '94), pages 235-243, San Francisco, 1994. Morgan Kaufmann.
13. F. Glover and M. Laguna. Tabu search. In C. Reeves, editor, Modern Heuristic Techniques for Combinatorial Problems, Oxford, England, 1993. Blackwell Scientific Publishing.
14. M. I. Jordan, Z. Ghahramani, T. Jaakkola, and L. K. Saul. An introduction to variational approximations methods for graphical models. In M. I. Jordan, editor, Learning in Graphical Models. Kluwer, Dordrecht, Netherlands, 1998.
15. M. Koivisto and K. Sood. Exact Bayesian structure discovery in Bayesian networks. Journal of Machine Learning Research, 5:549-573, 2004.
16. S. L. Lauritzen and N. Wermuth. Graphical models for associations between variables, some of which are qualitative and some quantitative. Annals of Statistics, 17:31-57, 1989.
17. J. Martin and K. VanLehn. Discrete factor analysis: Learning hidden variables in Bayesian networks. Technical report, Department of Computer Science, University of Pittsburgh, 1995.
18. P. McCullagh and J.A. Neider. Generalized Linear Models. Chapman & Hall, London, 1989.
19. A. Moore and W. Wong. Optimal reinsertion: A new search operator for accelerated and more accurate Bayesian network structure learning. In T. Fawcett and N. Mishra, editors, Proceedings of the 20th International Conference on Machine Learning (ICML '03), pages 552-559, Menlo Park, California, 2003.
20. K. Murphy and Y. Weiss. Loopy belief propagation for approximate inference: An empirical study. In K. Laskey and H. Prade, editors, Proc. Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI '99), page 467-475, San Francisco, 1999. Morgan Kaufmann.
21. I. Nachman, A. Regev, and N. Friedman. Inferring quantitative models of regulatory networks from expression data. Bioinformatics, 20(Suppl 1):S1248-1256, 2004.
22. G. Schwarz. Estimating the dimension of a model. Annals of Statistics, 6:461-464, 1978.
23. M.A. Shwe, B. Middleton, D.E. Heckerman, M. Henrion, E.J. Horvitz, H.P. Lehmann, and G.F. Cooper. Probabilistic diagnosis using a reformulation of the INTERNIST-1/QMR knowledge base. I. The probabilistic model and inference algorithms. Methods of Information in Medicine, 30:241-55, 1991.
24. T. Silander and P. Myllym. A simple approach for finding the globally optimal Bayesian network structure. In Dechter and Richardson, editors, Proc. Twenty Second Conference on Uncertainty in Artificial Intelligence (UAI '06), San Francisco, 2006. Morgan Kaufmann.
25. A. Singh and A. Moore. Finding optimal Bayesian networks by dynamic programming. Technical report, Carnegie Mellon University, 2005.
26. P. T. Spellman, G. Sherlock, M. Q. Zhang, V. R. Iyer, K. Anders, M. B. Eisen, P. O. Brown, D. Botstein, and B. Futcher. Comprehensive identification of cell cycle-regulated genes of the yeast saccharomyces cerevisiae by microarray hybridization. Molecular Biology of the Cell, 9(12): 3273-97, 1998.
27. M. Teyssier and D. Koller. Ordering-based search: A simple and effective algorithm for learning Bayesian networks. In F. Bacchus and T. Jaakkola, editors, Proc. Twenty First Conference on Uncertainty in Artificial Intelligence (UAI '05), pages 584-590, San Francisco, 2005. Morgan Kaufmann.
28. R. Parr U. Lerner and D. Koller. Bayesian fault detection and diagnosis in dynamic systems. In Proc. of the Seventeenth National Conference on Artificial Intelligence (AAAI), pages 531-537, 2000.
29. J. Wilkinson. The Algebric Eigenvalue Problem. Claderon Press, Oxford, 1965.
30. N.L. Zhang. Hierarchical latent class models for cluster analysis. Journal of Machine Learning Research, 5:697-723, 2004.