Structure Learning for Bayesian Networks over Labeled DAGs

Antti Hyttinen, Johan Pensar, Juha Kontinen, Jukka Corander
; Proceedings of the Ninth International Conference on Probabilistic Graphical Models, PMLR 72:133-144, 2018.

Abstract

Graphical models based on labeled directed acyclic graphs (LDAGs) allow for representing context-specific independence relations in addition to regular conditional independencies. Modeling such constraints has been demonstrated to be important for expressiveness, interpretation and predictive ability. In this paper, we build theoretical results that make constraint-based and exact score-based structure discovery possible for this interesting model class. In detail, we present the first constraint-based learning method for LDAGs. The orientation rules use context-specific independencies for principled orientation of additional (causal) edges. We also present the first exact score-based learning method for LDAGs, that employs a branch and bound for the especially computational demanding task of local score calculation, after which exact DAG search can be used. Simulations verify the good performance of our methods in different data analysis tasks.

Cite this Paper


BibTeX
@InProceedings{pmlr-v72-hyttinen18a, title = {Structure Learning for Bayesian Networks over Labeled DAGs}, author = {Hyttinen, Antti and Pensar, Johan and Kontinen, Juha and Corander, Jukka}, booktitle = {Proceedings of the Ninth International Conference on Probabilistic Graphical Models}, pages = {133--144}, year = {2018}, editor = {Václav Kratochvíl and Milan Studený}, volume = {72}, series = {Proceedings of Machine Learning Research}, address = {Prague, Czech Republic}, month = {11--14 Sep}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v72/hyttinen18a/hyttinen18a.pdf}, url = {http://proceedings.mlr.press/v72/hyttinen18a.html}, abstract = {Graphical models based on labeled directed acyclic graphs (LDAGs) allow for representing context-specific independence relations in addition to regular conditional independencies. Modeling such constraints has been demonstrated to be important for expressiveness, interpretation and predictive ability. In this paper, we build theoretical results that make constraint-based and exact score-based structure discovery possible for this interesting model class. In detail, we present the first constraint-based learning method for LDAGs. The orientation rules use context-specific independencies for principled orientation of additional (causal) edges. We also present the first exact score-based learning method for LDAGs, that employs a branch and bound for the especially computational demanding task of local score calculation, after which exact DAG search can be used. Simulations verify the good performance of our methods in different data analysis tasks.} }
Endnote
%0 Conference Paper %T Structure Learning for Bayesian Networks over Labeled DAGs %A Antti Hyttinen %A Johan Pensar %A Juha Kontinen %A Jukka Corander %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-hyttinen18a %I PMLR %J Proceedings of Machine Learning Research %P 133--144 %U http://proceedings.mlr.press %V 72 %W PMLR %X Graphical models based on labeled directed acyclic graphs (LDAGs) allow for representing context-specific independence relations in addition to regular conditional independencies. Modeling such constraints has been demonstrated to be important for expressiveness, interpretation and predictive ability. In this paper, we build theoretical results that make constraint-based and exact score-based structure discovery possible for this interesting model class. In detail, we present the first constraint-based learning method for LDAGs. The orientation rules use context-specific independencies for principled orientation of additional (causal) edges. We also present the first exact score-based learning method for LDAGs, that employs a branch and bound for the especially computational demanding task of local score calculation, after which exact DAG search can be used. Simulations verify the good performance of our methods in different data analysis tasks.
APA
Hyttinen, A., Pensar, J., Kontinen, J. & Corander, J.. (2018). Structure Learning for Bayesian Networks over Labeled DAGs. Proceedings of the Ninth International Conference on Probabilistic Graphical Models, in PMLR 72:133-144

Related Material