Computer Science undergraduate thesis: Uniform Generation of k-trees for Learning the Structure of Bayesian Networks (USP 2016).
-
Updated
May 15, 2018 - Go
Computer Science undergraduate thesis: Uniform Generation of k-trees for Learning the Structure of Bayesian Networks (USP 2016).
Bounded Tree-width Bayesian Networks learner
Latent K-tree Bayesian Networks learner
Learn probabilistic models with hidden variables in a k-tree structure
Add a description, image, and links to the bounded-treewidth topic page so that developers can more easily learn about it.
To associate your repository with the bounded-treewidth topic, visit your repo's landing page and select "manage topics."