569 search results - page 38 / 114 » Online Bounds for Bayesian Algorithms |
ECSQARU
1995
Springer
15 years 1 months ago
1995
Springer
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
109
click to vote
JMLR
2010
14 years 4 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...
104
click to vote
NIPS
2008
14 years 11 months ago
2008
Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all di...
EUROCOLT
1995
Springer
15 years 1 months ago
1995
Springer
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...