11 search results - page 1 / 3 » Applications of Binary Classification and Adaptive Boosting ... |
ISMIR
2005
Springer
13 years 10 months ago
2005
Springer
In the “query-by-humming” problem, we attempt to retrieve a specific song from a target set based on a sung query. Recent evaluations of query-by-humming systems show that th...
ML
2002
ACM
13 years 4 months 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...
EUROCOLT
1995
Springer
13 years 8 months ago
1995
Springer
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
JMLR
2010
12 years 11 months ago
2010
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
CVPR
2009
IEEE
15 years 6 days ago
2009
IEEE
Many semi-supervised learning algorithms only
deal with binary classification. Their extension to the
multi-class problem is usually obtained by repeatedly
solving a set of bina...