12 search results - page 1 / 3 » Bayesian Network Score Approximation using a Metagraph Kerne... |
NIPS
2008
13 years 6 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
ICPR
2004
IEEE
14 years 5 months ago
2004
IEEE
The likelihood for patterns of continuous attributes for the naive Bayesian classifier (NBC) may be approximated by kernel density estimation (KDE), letting every pattern influenc...
JMLR
2010
12 years 11 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
In many domains, a Bayesian network's topological structure is not known a priori and must be inferred from data. This requires a scoring function to measure how well a propo...
UAI
2008
13 years 6 months ago
2008
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...