141 search results - page 4 / 29 » Learning r-of-k Functions by Boosting |
PAMI
2011
13 years 1 months ago
2011
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
PAMI
2011
13 years 1 months ago
2011
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
NIPS
2007
13 years 8 months ago
2007
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...
ICML
2008
IEEE
14 years 7 months ago
2008
IEEE
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
COLT
2004
Springer
13 years 12 months ago
2004
Springer
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...