Sciweavers

5866 search results - page 803 / 1174
» An e-Process Selection Model
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
ICML
2006
IEEE
16 years 7 months ago
Experience-efficient learning in associative bandit problems
We formalize the associative bandit problem framework introduced by Kaelbling as a learning-theory problem. The learning environment is modeled as a k-armed bandit where arm payof...
Alexander L. Strehl, Chris Mesterharm, Michael L. ...
132
Voted
ICML
2005
IEEE
16 years 7 months ago
Fast condensed nearest neighbor rule
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
Fabrizio Angiulli
ICML
2005
IEEE
16 years 7 months ago
Efficient discriminative learning of Bayesian network classifier via boosted augmented naive Bayes
The use of Bayesian networks for classification problems has received significant recent attention. Although computationally efficient, the standard maximum likelihood learning me...
Yushi Jing, Vladimir Pavlovic, James M. Rehg
ICML
2003
IEEE
16 years 7 months ago
Margin Distribution and Learning
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
Ashutosh Garg, Dan Roth