S. Ammar, P. Leray, B. Defourny, and L. Wehenkel, High-dimensional probability density estimation with randomized ensembles of tree structured bayesian networks, Proceedings of the fourth European Workshop on Probabilistic Graphical Models (PGM08), pp.9-16, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00412288

S. Ammar, P. Leray, B. Defourny, and L. Wehenkel, Probability density estimation by perturbing and combining tree structured markov networks, Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, pp.156-167, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00412883

S. Ammar, P. Leray, F. Schnitzler, and L. Wehenkel, Sub-quadratic markov tree mixture learning based on randomizations of the chow-liu algorithm, the Fifth European Workshop on Probabilistic Graphical Models (PGM-2010), pp.17-25, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00568028

S. Ammar, P. Leray, and L. Wehenkel, Sub-quadratic markov tree mixture models for probability density estimation, 19th International Conference on Computational Statistics (COMPSTAT 2010), pp.673-680, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00487353

V. Auvray, L. S. Wehenkel, and . Cal, On the construction of the inclusion boundary neighbourhood for markov equivalence classes of bayesian network structures, Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI-02), pp.26-35, 2002.

B. Broom, K. Do, and D. Subramanian, Model averaging for structure learning in bayesian networks: an experimental study, 2008.

D. Chickering, D. Geiger, and D. Heckerman, Learning bayesian networks is NPhard, 1994.

D. Chickering, Optimal structure identification with greedy search, Journal of Machine Learning Research, vol.3, pp.507-554, 2003.

C. Chow and C. N. Liu, Approximating discrete probability distributions with dependence trees, IEEE Transactions on Information Theory, vol.14, issue.3, pp.462-467, 1968.

G. Cooper and E. Herskovits, A bayesian method for the induction of probabilistic networks from data, Machine Learning, vol.9, pp.309-347, 1992.

N. Friedman, I. Nachman, and D. Per, Learning bayesian network structure from massive datasets: The "sparse candidate" algorithm, Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI), pp.206-215, 1999.

J. Ide, F. Cozman, and F. Ramos, Generating random bayesian networks with constraints on induced width, ECAI, pp.323-327, 2004.

S. R. De-morais and A. Aussem, A novel markov boundary based feature subset selection algorithm, Neurocomputing, vol.73, pp.578-584, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00383776

H. T. Nguyen, P. Leray, and G. Ramstein, Summarizing and visualizing a set of bayesian networks with quasi essential graphs, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00645005

J. Pearl, Fusion, propagation, and structuring in belief networks, Artificial Intelligence, vol.29, pp.241-288, 1986.

J. Pearl and T. S. Verma, KR'91: Principles of Knowledge Representation and Reasoning, pp.441-452, 1991.

M. Scutari, Measures of Variability for Graphical Models, 2011.

P. Spirtes, C. Glymour, and R. Scheines, Causation, prediction, and search, 1993.

I. Tsamardinos, C. Aliferis, and A. Statnikov, Algorithms for large scale markov blanket discovery, The 16th International FLAIRS Conference, pp.376-380, 2003.

I. Tsamardinos, C. Aliferis, and A. Statnikov, Time and sample efficient discovery of markov blankets and direct causal relations, Proceedings of the 9th CAN SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.673-678, 2003.

I. Tsamardinos, L. Brown, and C. Aliferis, The max-min hill-climbing bayesian network structure learning algorithm, Machine Learning, vol.65, pp.31-78, 2006.

I. Tsamardinos, G. Borboudakis, J. Balcázar, F. Bonchi, and A. Gionis, Permutation testing improves bayesian network learning, Machine Learning and Knowledge Discovery in Databases, vol.6323, pp.322-337, 2010.