2988 search results - page 22 / 598 » Experiments with a New Boosting Algorithm |
89
Voted
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
EUROGP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
COLT
2005
Springer
15 years 3 months ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
AVBPA
2005
Springer
15 years 3 months ago
2005
Springer
For Pen-input on-line signature verification algorithms, the influence of intersession variability is a considerable problem because hand-written signatures change with time, causi...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...