Timezone: »
Poster
Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables
Mauro Scanagatta · Giorgio Corani · Cassio de Campos · Marco Zaffalon
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
-
2021 : Causal Expectation-Maximisation »
Marco Zaffalon · Alessandro Antonucci · Rafael Cabañas -
2021 : Zaffalon, Antonucci, Cabañas - Causal Expectation-Maximisation »
Marco Zaffalon · Alessandro Antonucci · Rafael Cabañas -
2015 Poster: Learning Bayesian Networks with Thousands of Variables »
Mauro Scanagatta · Cassio de Campos · Giorgio Corani · Marco Zaffalon -
2014 Poster: Advances in Learning Bayesian Networks of Bounded Treewidth »
Siqi Nie · Denis Maua · Cassio P de Campos · Qiang Ji -
2014 Spotlight: Advances in Learning Bayesian Networks of Bounded Treewidth »
Siqi Nie · Denis Maua · Cassio P de Campos · Qiang Ji -
2014 Poster: Global Sensitivity Analysis for MAP Inference in Graphical Models »
Jasper De Bock · Cassio P de Campos · Alessandro Antonucci -
2011 Poster: Solving Decision Problems with Limited Information »
Denis Maua · Cassio P de Campos -
2011 Spotlight: Solving Decision Problems with Limited Information »
Denis Maua · Cassio P de Campos