288 citations · 376 across the 8 of their papers we have counts for
1 paper · 2 filters
Tomi Silander, Petri Myllymaki
We study the problem of learning the best Bayesian network structure with respect to a decomposable score such as BDe, BIC or AIC. This problem is known to be NP-hard, which means…