364 search results - page 6 / 73 » On the generalization of soft margin algorithms |
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
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...
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
In most of the learning algorithms, examples in the training set are treated equally. Some examples, however, carry more reliable or critical information about the target than the ...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
COLT
2000
Springer
14 years 5 days 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...