94 search results - page 5 / 19 » Boosting Lazy Decision Trees |
JMLR
2010
13 years 2 months ago
2010
This paper introduces a Bayesian algorithm for constructing predictive models from data that are optimized to predict a target variable well for a particular instance. This algori...
AAAI
1996
13 years 9 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...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
This work presents decision trees adequate for the classification of series data. There are several methods for this task, but most of them focus on accuracy. One of the requirem...
ICML
1999
IEEE
14 years 8 months ago
1999
IEEE
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
COLT
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...