Skip to yearly menu bar Skip to main content


Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables

Mauro Scanagatta · Giorgio Corani · Cassio de Campos · Marco Zaffalon

Area 5+6+7+8 #80

Keywords: [ Graphical Models ] [ (Other) Probabilistic Models and Methods ] [ (Other) Statistics ]


We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian network greatly reduces the complexity of inferences. Yet, being a global property of the graph, it considerably increases the difficulty of the learning process. Our novel algorithm accomplishes this task, scaling both to large domains and to large treewidths. Our novel approach consistently outperforms the state of the art on experiments with up to thousands of variables.

Live content is unavailable. Log in and register to view live content