486 search results - page 2 / 98 » Boosting and Hard-Core Sets |
ICDM
2009
IEEE
14 years 8 days ago
2009
IEEE
—The success of transfer to improve learning on a target task is highly dependent on the selected source data. Instance-based transfer methods reuse data from the source tasks to...
ML
2007
ACM
13 years 5 months ago
2007
ACM
AdaBoost.OC has been shown to be an effective method in boosting “weak” binary classifiers for multi-class learning. It employs the Error-Correcting Output Code (ECOC) method ...
EMNLP
2009
13 years 3 months ago
2009
This paper explores two classes of model adaptation methods for Web search ranking: Model Interpolation and error-driven learning approaches based on a boosting algorithm. The res...
WWW
2011
ACM
13 years 16 days ago
2011
ACM
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
NIPS
2007
13 years 7 months ago
2007
This paper studies boosting algorithms that make a single pass over a set of base classifiers. We first analyze a one-pass algorithm in the setting of boosting with diverse base...