155 citations · 155 across the 1 of their papers we have counts for
3 papers · 1 filter
Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete and Incomplete Data Sets
Mauro Scanagatta, Giorgio Corani, Marco Zaffalon +2
Learning a Bayesian networks with bounded treewidth is important for reducing the complexity of the inferences. We present a novel anytime algorithm (k-MAX) method for this task, w…
Entropy-based Pruning for Learning Bayesian Networks using BIC
Cassio P. de Campos, Mauro Scanagatta, Giorgio Corani +1
For decomposable score-based structure learning of Bayesian networks, existing approaches first compute a collection of candidate parent sets for each variable and then optimize ov…
Learning Bounded Treewidth Bayesian Networks with Thousands of Variables
Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos +1
We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian greatly reduces the comp…