Sciweavers

254 search results - page 28 / 51
» Multi-interval Discretization Methods for Decision Tree Lear...
Sort
View
COLT
1998
Springer
13 years 12 months ago
Improved Boosting Algorithms using Confidence-Rated Predictions
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...
Robert E. Schapire, Yoram Singer
ICPR
2006
IEEE
14 years 8 months ago
Learning Policies for Efficiently Identifying Objects of Many Classes
Viola and Jones (VJ) cascade classification methods have proven to be very successful in detecting objects belonging to a single class -- e.g., faces. This paper addresses the mor...
Ahmed M. Elgammal, Ramana Isukapalli, Russell Grei...
GREC
2003
Springer
14 years 26 days ago
User Adaptation for Online Sketchy Shape Recognition
This paper presents a method of online sketchy shape recognition that can adapt to different user sketching styles. The adaptation principle is based on incremental active learning...
Zhengxing Sun, Liu Wenyin, Binbin Peng, Bin Zhang,...
ML
2006
ACM
163views Machine Learning» more  ML 2006»
13 years 7 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos