Sciweavers

301 search results - page 15 / 61
» On the Optimality of Probability Estimation by Random Decisi...
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford
UAI
2004
13 years 9 months ago
Dependent Dirichlet Priors and Optimal Linear Estimators for Belief Net Parameters
A Bayesian belief network is a model of a joint distribution over a finite set of variables, with a DAG structure representing immediate dependencies among the variables. For each...
Peter Hooper
MSOM
2010
65views more  MSOM 2010»
13 years 2 months ago
The Optimal Composition of Influenza Vaccines Subject to Random Production Yields
The Vaccine and Related Biologic Products Advisory Committee meets at least once a year to decide the composition of the influenza vaccine in the U.S. Past evidence suggests that ...
Soo-Haeng Cho
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer