Timezone: »

Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables
Mauro Scanagatta · Giorgio Corani · Cassio de Campos · Marco Zaffalon

Tue Dec 06 09:00 AM -- 12:30 PM (PST) @ Area 5+6+7+8 #80

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.

Author Information

Mauro Scanagatta (Idsia)
Giorgio Corani (Idsia)
Cassio de Campos (Queen's University Belfast)
Marco Zaffalon (IDSIA)

More from the Same Authors