Sciweavers

153 search results - page 1 / 31
» Worst-Case Analysis of Selective Sampling for Linear-Thresho...
Sort
View
NIPS
2004
13 years 7 months ago
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
JMLR
2006
99views more  JMLR 2006»
13 years 6 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
EOR
2007
99views more  EOR 2007»
13 years 6 months ago
Learning lexicographic orders
The purpose of this paper is to learn the order of criteria of lexicographic decision under various reasonable assumptions. We give a sample evaluation and an oracle based algorit...
József Dombi, Csanád Imreh, Ná...
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
13 years 10 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
COLT
2001
Springer
13 years 10 months ago
Smooth Boosting and Learning with Malicious Noise
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
Rocco A. Servedio