|
Abstract
|
|
|---|---|
| Mixtures of polynomials (MoPs) are a non-parametric density estimation technique for hybrid Bayesian networks with continuous and discrete variables. We propose two methods for learning MoP approximations of conditional densities from data. Both approaches are based on learning MoP approximations of the joint density and the marginal density of the conditioning variables, but they differ as to how the MoP approximation of the quotient of the two densities is found. We illustrate the methods using data sampled from a simple Gaussian Bayesian network. We study and compare the performance of these methods with the approach for learning mixtures of truncated basis functions from data. | |
|
International
|
Si |
|
|
|
|
Book Edition
|
|
|
Book Publishing
|
Springer |
|
ISBN
|
978-3-642-40642-3 |
|
Series
|
|
|
Book title
|
Advances in Artificial Intelligence, Lecture Notes in Artificial Intelligence 8109 |
|
From page
|
363 |
|
To page
|
372 |