Learning Bounded Treewidth Bayesian Networks
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the same time allow for tractable inference. While the method of thin junction trees can, in principle, be used for this purpose, its fully greedy nature makes it prone to overfitting, particularly when data is scarce. In this work we present a novel method for learning Bayesian networks of bounded treewidth that employs...[Show more]
|Collections||ANU Research Publications|
|Source:||Journal of Machine Learning Research|
|01_Elidan_Learning_Bounded_Treewidth_2008.pdf||726.46 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.