|
|
|
|
RI | Publications | Tractable Bayesian Learning of Tree Belief Networks
|
|
Text only version of this site
Tractable Bayesian Learning of Tree Belief Networks
M. Meila and T. Jaakkola
tech. report CMU-RI-TR-00-15, Robotics Institute, Carnegie Mellon University, May, 2000.
Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference
| Download [Help] |
Adobe portable document format (pdf) [222 KB] Compressed postscript (ps.gz) [69 KB]
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
| Abstract |
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tractable, in the sense that the posterior is also decomposable and can be completely determined analytically in polynomial time. This follows from two main results: First, we show that factored distributions over spanning trees in a graph can be integrated in closed form. Second, we examine priors over tree parameters and show that a set of assumptions similar to (Heckerman and al., 1995) constrain the tree parameter priors to be a compactly parametrized product of Dirichlet distributions. Besides allowing for exact Bayesian learning, these results permit us to formulate a new class of tractable latent variable models in which the likelihood of a data point is computed through an ensemble average over tree structures.
| Notes |
Sponsor: Office of Naval Research
Grant ID: N00014-98-C-0326
Associated center: VASC
| Text Reference |
M. Meila and T. Jaakkola, Tractable Bayesian Learning of Tree Belief Networks, tech. report CMU-RI-TR-00-15, Robotics Institute, Carnegie Mellon University, May, 2000.
| BibTeX Reference |
@techreport{Meila_2000_3362,
author = "Marina Meila and Tommi Jaakkola",
title = "Tractable Bayesian Learning of Tree Belief Networks",
institution = "Robotics Institute, Carnegie Mellon University",
month = "May",
year = "2000",
number = "CMU-RI-TR-00-15",
address = "Pittsburgh, PA"
}