486 search results - page 15 / 98 » Boosting and Hard-Core Sets |
ICPR
2000
IEEE
15 years 4 months ago
2000
IEEE
In the recent years support vector machines (SVMs) have been successfully applied to solve a large number of classification problems. Training an SVM, usually posed as a quadrati...
98
Voted
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
AdaBoost and support vector machines (SVM) algorithms are commonly used in the field of object recognition. As classifiers, their classification performance is sensitive to affect...
106
click to vote
ML
2002
ACM
15 years 18 hour ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
113
Voted
AIPS
2010
15 years 17 days ago
2010
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...