187 search results - page 9 / 38 » Bounding the cost of learned rules |
ALT
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
FLAIRS
1998
13 years 8 months ago
1998
Weintroduce a significant improvementfor a relatively newmachine learning methodcalled Transformation-Based Learning. By applying a MonteCarlo strategy to randomly sample from the...
COLT
2005
Springer
13 years 9 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
PAMI
2011
13 years 2 months ago
2011
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
SAGA
2009
Springer
14 years 1 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...