Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

103

STOC
1996
ACM

104views Algorithms» more STOC 1996»

On the Boosting Ability of Top-Down Decision Tree Learning Algorithms

15 years 7 months ago

On the Boosting Ability of Top-Down Decision Tree Learning Algorithms

Download www.cis.upenn.edu

Michael J. Kearns, Yishay Mansour

Real-time Traffic

Algorithms | STOC 1996 |

claim paper

Related Content

» Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree

» A Simpler Analysis of the Multiway Branching Decision Tree Boosting Algorithm

» PMCRI A Parallel Modular Classification Rule Induction Framework

» A Boosting Algorithm for Classification of SemiStructured Text

» Boosting Lazy Decision Trees

» The Alternating Decision Tree Learning Algorithm

» Agnostic Boosting

» Improved Boosting Algorithms using ConfidenceRated Predictions

» Location disambiguation in local searches using gradient boosted decision trees

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1996
Where	STOC
Authors	Michael J. Kearns, Yishay Mansour

Comments (0)