94 search results - page 14 / 19 » Boosting Lazy Decision Trees |
ICTAI
2007
IEEE
14 years 1 months ago
2007
IEEE
An adaptive boosting ensemble algorithm for classifying homogeneous distributed data streams is presented. The method builds an ensemble of classifiers by using Genetic Programmi...
MCS
2007
Springer
14 years 1 months ago
2007
Springer
Rotation Forest is a recently proposed method for building classifier ensembles using independently trained decision trees. It was found to be more accurate than bagging, AdaBoost...
AUSDM
2006
Springer
13 years 11 months ago
2006
Springer
In response to the rapid development of DNA Microarray technology, many classification methods have been used for Microarray classification. SVMs, decision trees, Bagging, Boostin...
JAIR
2008
13 years 7 months ago
2008
In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
COLT
2001
Springer
14 years 2 days ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...