Learning Bayesian Networks by Branching on Constraints

Thijs van Ommen
Proceedings of the Ninth International Conference on Probabilistic Graphical Models, PMLR 72:511-522, 2018.

Abstract

We consider the Bayesian network structure learning problem, and present a new algorithm for enumerating the $k$ best Markov equivalence classes. This algorithm is score-based, but uses conditional independence constraints as a way to describe the search space of equivalence classes. The techniques we use here can potentially lead to the development of score-based methods that deal with more complex domains, such as the presence of latent confounders or feedback loops. We evaluate our algorithm’s performance on simulated continuous data.

Cite this Paper

BibTeX
@InProceedings{pmlr-v72-ommen18a, title = {Learning Bayesian Networks by Branching on Constraints}, author = {van Ommen, Thijs}, booktitle = {Proceedings of the Ninth International Conference on Probabilistic Graphical Models}, pages = {511--522}, year = {2018}, editor = {Kratochvíl, Václav and Studený, Milan}, volume = {72}, series = {Proceedings of Machine Learning Research}, month = {11--14 Sep}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v72/ommen18a/ommen18a.pdf}, url = {https://proceedings.mlr.press/v72/ommen18a.html}, abstract = {We consider the Bayesian network structure learning problem, and present a new algorithm for enumerating the $k$ best Markov equivalence classes. This algorithm is score-based, but uses conditional independence constraints as a way to describe the search space of equivalence classes. The techniques we use here can potentially lead to the development of score-based methods that deal with more complex domains, such as the presence of latent confounders or feedback loops. We evaluate our algorithm’s performance on simulated continuous data.} }
Endnote
%0 Conference Paper %T Learning Bayesian Networks by Branching on Constraints %A Thijs van Ommen %B Proceedings of the Ninth International Conference on Probabilistic Graphical Models %C Proceedings of Machine Learning Research %D 2018 %E Václav Kratochvíl %E Milan Studený %F pmlr-v72-ommen18a %I PMLR %P 511--522 %U https://proceedings.mlr.press/v72/ommen18a.html %V 72 %X We consider the Bayesian network structure learning problem, and present a new algorithm for enumerating the $k$ best Markov equivalence classes. This algorithm is score-based, but uses conditional independence constraints as a way to describe the search space of equivalence classes. The techniques we use here can potentially lead to the development of score-based methods that deal with more complex domains, such as the presence of latent confounders or feedback loops. We evaluate our algorithm’s performance on simulated continuous data.
APA
van Ommen, T.. (2018). Learning Bayesian Networks by Branching on Constraints. Proceedings of the Ninth International Conference on Probabilistic Graphical Models, in Proceedings of Machine Learning Research 72:511-522 Available from https://proceedings.mlr.press/v72/ommen18a.html.

Related Material