Sciweavers

94 search results - page 3 / 19
» Boosting Lazy Decision Trees
Sort
View
SIGIR
2005
ACM
15 years 3 months ago
Boosted decision trees for word recognition in handwritten document retrieval
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon ...
Nicholas R. Howe, Toni M. Rath, R. Manmatha
PRL
2008
213views more  PRL 2008»
14 years 9 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 2 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...