17 search results - page 1 / 4 » Some Discriminant-Based PAC Algorithms |
JMLR
2006
13 years 4 months ago
2006
A classical approach in multi-class pattern classification is the following. Estimate probability distributions that generated the observations for each label class, and then labe...
COLT
2000
Springer
13 years 9 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
ALT
1999
Springer
13 years 9 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
COLT
2004
Springer
13 years 8 months ago
2004
Springer
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...