(Enter summary)
Abstract: this paper is to push this interaction
further in light of these recent developments. In particular,
we perform experiments suggested by the formal
results for Adaboost and C4:5 within the weak
learning framework. We concentrate on two particularly
intriguing issues.
First, the theoretical boosting results for top-down
decision tree algorithms such as C4:5 [12] suggest that
a new splitting criterion may result in trees that are
smaller and more accurate than those obtained using
the usual... (Update)
Cited by: More
Pattern Analysis Applications (2002)5:201--209 - Ownership And Copyright (2002)
(Correct)
A Heuristic for Learning Decision Trees and Pruning.. - Ranilla, Luaces..
(Correct)
Learning Multi-label Alternating Decision Trees from.. - De Comite, Gilleron..
(Correct)
Active bibliography (related documents): More All
0.3: On the Boosting Ability of Top-Down Decision Tree Learning.. - Kearns, Mansour (1997)
(Correct)
0.2: Learning Structured Visual Detectors From User Input At Multiple.. - Jaimes (2001)
(Correct)
0.2: Automatic Selection of Visual Features and Classifiers - Jaimes, Chang (2000)
(Correct)
Similar documents based on text: More All
0.4: Maximizing Top-down Constraints for Unification-based Systems - Tomuro
(Correct)
0.3: Boosting Theory Towards Practice: - Recent Developments In
(Correct)
0.2: Integrating Top-Down and Bottom-Up Sensory Processing by.. - Siegel, Körding, König (2000)
(Correct)
Related documents from co-citation: More All
19: Programs for machine learning (context) - Quinlan - 1993
15: The strength of weak learnability
- Schapire - 1990
13: A decision-theoretic generalization of on-line learning and an application to bo..
- Freund, Schapire - 1997
BibTeX entry: (Update)
Tom Dietterich, Michael Kearns, and Yishay Mansour. Applying the weak learning framework to understand and improve C4.5. In Machine Learning: Proceedings of the Thirteenth International Conference, 1996. http://citeseer.ist.psu.edu/article/dietterich96applying.html More
@inproceedings{ dietterich96applying,
author = "Tom Dietterich and Michael Kearns and Yishay Mansour",
title = "Applying the weak learning framework to understand and improve {C}4.5",
booktitle = "Proc. 13th International Conference on Machine Learning",
publisher = "Morgan Kaufmann",
pages = "96--104",
year = "1996",
url = "citeseer.ist.psu.edu/article/dietterich96applying.html" }
Citations (may not include all citations):
509
A decision-theoretic generalization of on-line learning and ..
- Freund, Schapire - 1995
465
Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
190
Wadsworth International Group (context) - Breiman, Friedman et al. - 1984
180
Boosting a weak learning algorithm by majority
- Freund - 1995
149
Information Processing Letters (context) - Blumer, Ehrenfeucht et al. - 1987
98
Discrete Multivariate Analysis: Theory and practice (context) - Bishop, Fienberg et al. - 1977
96
Learning decision trees using the Fourier spectrum
- Kushilevitz, Mansour - 1991
92
An empirical comparison of selection measures for decision-t.. (context) - Mingers - 1989
82
UCI repository of machine learning databases [machine-readab.. (context) - Murphy, Aha - 1994
74
Exact learning via the monotone theory (context) - Bshouty - 1993
63
Weakly learning DNF and characterizing statistical query lea..
- Blum, Furst et al. - 1994
32
the boosting ability of topdown decision tree learning algor..
- Kearns, Mansour - 1996
5
Assessing learning procedures using DELVE (context) - Hinton, Neal et al. - 1995
4
Some experiments with a new boosting algorithm (context) - Freund, Schapire
4
Proper statistical tests for comparing supervised classifica.. (context) - Dietterich - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://gopher.cs.orst.edu/~tgd/change-history.html): More
Value Function Approximations and Job-Shop Scheduling - Zhang, Dietterich (1995)
(Correct)
An Experimental Comparison of Three Methods for Constructing.. - Dietterich (1998)
(Correct)
The MAXQ Method for Hierarchical Reinforcement Learning - Dietterich (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC