Cowell, R., Dawid, A., Lauritzen, S., Spiegelhalter, D.: Probabilistic Networks and Expert Systems. Springer, Heidelberg (1999)
Auvray, V., Wehenkel, L.: Learning inclusion-optimal chordal graphs. In: Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence (UAI 2008), pp. 18-25. Morgan Kaufmann, San Francisco (2008)
Ridgeway, G.: Looking for lumps: boosting and bagging for density estimation. Computational Statistics & Data Analysis 38(4), 379-392 (2002)
Ammar, S., Leray, P., Defourny, B., Wehenkel, L.: High-dimensional probability density estimation with randomized ensembles of tree structured bayesian networks. In: Proceedings of the fourth European Workshop on Probabilistic Graphical Models (PGM 2008), pp. 9-16 (2008)
Chow, C., Liu, C.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory 14(3), 462-467 (1968)
Chickering,D.,Heckerman,D.:Efficient approximations for the marginal likelihoodof bayesian networks with hidden variables.Machine Learning 29(2-3), 181-212 (1997)
Robinson, R.: Counting unlabeled acyclic digraphs. In: Little, C.H.C. (ed.) Combinatorial Mathematics V. Lecture Notes in Mathematics, vol. 622, pp. 28-43. Springer, Berlin (1977)
Madigan, D., Raftery, A.: Model selection and accounting for model uncertainty in graphical models using occam's window. The American Statistical Association 89, 1535-1546 (1994)
Madigan, D., York, J.: Bayesian graphical models for discrete data. International Statistical Review 63, 215-232 (1995)
Friedman, N., Koller, D.: Being bayesian about network structure. In: Boutilier, C., Goldszmidt, M. (eds.) Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence (UAI 2000), pp. 201-210. Morgan Kaufmann Publishers, San Francisco (2000)
Pearl, J.: Fusion, propagation, and structuring in belief networks. Artificial Intelligence 29, 241-288 (1986)
Meila-Predoviciu, M.: Learning with Mixtures of Trees. PhD thesis, MIT (1999)
Efron, B., Tibshirani, R.J.: An introduction to the Bootstrap. Monographs on Statistics and Applied Probability, vol. 57. Chapman and Hall, Boca Raton (1993)
Kullback, S., Leibler, R.: On information and sufficiency. Annals of Mathematical Statistics 22(1), 79-86 (1951)
Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B (Methodological) 39(1), 1-38 (1977)
Lowd, D., Domingos, P.: Naive bayes models for probability estimation. In (ICML 2005) Proceedings of the 22nd international conference on Machine Learning, pp. 529-536. ACM Press, New York (2005)
Rubinstein, R., Kroese, D.: The Cross-Entropy Method. A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning. In: Information Science and Statistics. Springer, Heidelberg (2004)
Rosset, S., Segal, E.: Boosting density estimation. In: Proceedings of the 16th International Conference on Neural Information Processing Systems (NIPS), Vancouver, British Columbia, Canada, pp. 267-281 (2002)