486 search results - page 6 / 98 » Boosting and Hard-Core Sets |
ICML
1999
IEEE
14 years 9 months ago
1999
IEEE
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...
AAAI
1996
13 years 10 months ago
1996
Breiman's bagging and Freund and Schapire's boosting are recent methods for improving the predictive power of classi er learning systems. Both form a set of classi ers t...
CORR
2000
Springer
13 years 8 months ago
2000
Springer
In this paper Schapire and Singer's AdaBoost.MH boosting algorithm is applied to the Word Sense Disambiguation (WSD) problem. Initial experiments on a set of 15 selected polys...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...