3668 search results - page 82 / 734 » Margin Distribution and Learning |
140
click to vote
ICMLA
2009
15 years 2 months ago
2009
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...
174
click to vote
PAMI
2011
14 years 11 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...
135
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
A cost-sensitive extension of boosting, denoted as asymmetric boosting, is presented. Unlike previous proposals, the new algorithm is derived from sound decision-theoretic princip...
118
click to vote
ALT
2008
Springer
16 years 1 months ago
2008
Springer
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
121
click to vote
SIGIR
2002
ACM
15 years 3 months ago
2002
ACM
Most test collections (like TREC and CLEF) for experimental research in information retrieval apply binary relevance assessments. This paper introduces a four-point relevance scal...