68 search results - page 8 / 14 » On the Margin Explanation of Boosting Algorithms |
PAMI
2011
13 years 2 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...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We examine the relationship between the predictions made by different learning algorithms and true posterior probabilities. We show that maximum margin methods such as boosted tre...
PAMI
2012
11 years 10 months ago
2012
—It has been shown that the Universum data, which do not belong to either class of the classification problem of interest, may contain useful prior domain knowledge for training...
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 ...
MCS
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. Boosting methods are known to improve generalization performances of learning algorithms reducing both bias and variance or enlarging the margin of the resulting multi-cl...