(Enter summary)
Abstract: . Bagging and boosting are methods that generate a diverse ensemble of classifiers
by manipulating the training data given to a "base" learning algorithm. Breiman has pointed
out that they rely for their effectiveness on the instability of the base learning algorithm. An
alternative approach to generating an ensemble is to randomize the internal decisions made by
the base algorithm. This general approach has been studied previously by Ali and Pazzani and
by Dietterich and Kong. This paper... (Update)
Cited by: More
Faculteit Economie - En Bedrijfskunde Hoveniersberg
(Correct)
Boosting Lazy Decision Trees - Xiaoli Zhang Fern
(Correct)
Random Projection for High Dimensional Data Clustering: - Cluster Ensemble Approach
(Correct)
Active bibliography (related documents): More All
0.9: An Experimental Comparison of Three Methods for Constructing.. - Dietterich (1998)
(Correct)
0.2: Diversity in Neural Network Ensembles - Brown (2003)
(Correct)
0.2: A Survey of Methods for Scaling Up Inductive Learning Algorithms - Provost, Kolluri (1997)
(Correct)
Similar documents based on text: More All
0.5: Low Bias Bagged Support Vector Machines - Valentini, Dietterich (2003)
(Correct)
0.4: A POMDP Approximation Algorithm that Anticipates the Need to.. - Bayer, Dietterich (2000)
(Correct)
0.4: Multiple Boosting: A Combination of Boosting and Bagging - Zheng, Webb (1998)
(Correct)
Related documents from co-citation: More All
54: Experiments with a New Boosting Algorithm
- Freund, Schapire - 1996
45: Bagging Predictors
- Breiman
38: A decision-theoretic generalization of on-line learning and an application to bo..
- Freund, Schapire - 1997
BibTeX entry: (Update)
Thomas G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Unpublished manuscript, 1998. http://citeseer.ist.psu.edu/article/dietterich98experimental.html More
@article{ dietterich00experimental,
author = "Thomas G. Dietterich",
title = "An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization",
journal = "Machine Learning",
volume = "40",
number = "2",
pages = "139-157",
year = "2000",
url = "citeseer.ist.psu.edu/article/dietterich98experimental.html" }
Citations (may not include all citations):
667
UCI repository of machine learning databases (context) - Merz, Murphy - 1996
500
Experiments with a new boosting algorithm
- Freund, Schapire - 1996
155
An empirical comparison of voting classification algorithms:..
- Bauer, Kohavi - 1997
107
Approximate statistical tests for comparing supervised class..
- Dietterich - 1998
89
and arcing classifiers (context) - Breiman
79
Error reduction through learning multiple descriptions
- Ali, Pazzani - 1996
62
Pruning adaptive boosting
- Margineantu, Dietterich - 1997
51
An empirical evaluation of bagging and boosting
- Maclin, Opitz - 1997
41
Heuristics of instability and stabilization in model selecti.. (context) - Breiman - 1994
14
Programs for Empirical Learning (context) - Quinlan - 1993
11
Machine learning bias (context) - Dietterich, Kong - 1995
5
A comparison of methods for learning and combining evidence ..
- Ali - 1995
2
University of California (context) - rep, Statistics
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)
The MAXQ Method for Hierarchical Reinforcement Learning - Dietterich (1998)
(Correct)
Learning in the Presence of Prior Knowledge: A Case Study Using .. - Eric Chown
(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