See this document in CiteSeerX!

An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants (1999)  (Make Corrections)  (155 citations)
Eric Bauer, Ron Kohavi
Machine Learning



  Home/Search   Context   Related

 
View or download:
connex.lip6.fr/~amini/./R...BaK98.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  connex.lip6.fr/~a...PageRessource (more)
Homepages:  R.Kohavi  

Rate this article: (best)
  Comment on this article  
Wide study of voting algorithms: Bagging, boosting (AdaBoost), pruning, Wagging, Trees, Naive-Bayes

Abstract: Methods for voting classification algorithms, such as Bagging and AdaBoost, have been shown to be very successful in improving the accuracy of certain classifiers for artificial and real-world datasets. We review these algorithms and describe a large empirical study comparing several variants in conjunction with a decision tree inducer (three variants) and a Naive-Bayes inducer. The purpose of the study is to improve our understanding of why and when these algorithms, which use perturbation,... (Update)

Cited by:   More
On a Unified Framework for Sampling with and.. - Martinez-Otzeta..   (Correct)
Boosting Lazy Decision Trees - Xiaoli Zhang Fern   (Correct)
Analyzing Bagging - Peter Buhlmann Eth (2001)   (Correct)

Active bibliography (related documents):   More   All
2.1:   An Empirical Comparison of Voting Classification Algorithms.. - Bauer, Kohavi (1998)   (Correct)
0.3:   Data Mining using MLC++ - A Machine Learning Library in C++ - Kohavi, Sommerfield.. (1997)   (Correct)
0.2:   Option Decision Trees with Majority Votes - Kohavi, Kunz (1997)   (Correct)

Similar documents based on text:   More   All
0.6:   Unknown - Bruises Creosote Musty   (Correct)
0.5:   Optimal Artificial Neural Network Architecture Selection.. - Andersen, Rimer, Martinez   (Correct)
0.4:   MultiBoosting: A Technique for Combining Boosting and Wagging - Webb (1998)   (Correct)

Related documents from co-citation:   More   All
50:   Experiments with a New Boosting Algorithm - Freund, Schapire - 1996
39:   A decision-theoretic generalization of on-line learning and an application to bo.. - Freund, Schapire - 1997
36:   Bagging Predictors - Breiman

BibTeX entry:   (Update)

E. Bauer and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, Boosting, and variants. To appear in Machine Learning (available at: http://reality.sgi.com/ronnyk/vote.ps.gz), 1998. http://citeseer.ist.psu.edu/bauer99empirical.html   More

@article{ bauer99empirical,
    author = "Eric Bauer and Ron Kohavi",
    title = "An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants",
    journal = "Machine Learning",
    volume = "36",
    number = "1-2",
    pages = "105-139",
    year = "1999",
    url = "citeseer.ist.psu.edu/bauer99empirical.html" }
Citations (may not include all citations):
2177   Programs for Machine Learning (context) - Quinlan - 1993
2133   Pattern Classification and Scene Analysis (context) - Duda, Hart - 1973
696   UCI repository of machine learning databases (context) - Blake, Keogh et al. - 1998
657   Bagging predictors - Breiman
546   An Introduction to the Bootstrap (context) - Efron, Tibshirani - 1993
509   A decision-theoretic generalization of on-line learning and .. - Freund, Schapire - 1995
500   Experiments with a new boosting algorithm - Freund, Schapire - 1996
367   Stacked generalization - Wolpert - 1992
340   Bayesian Theory (context) - Bernardo, Smith - 1993
301   Neural networks and the bias/variance dilemma (context) - Geman, Bienenstock et al. - 1992
273   The strength of weak learnability - Schapire - 1990
243   Boosting the margin: A new explanation for the effectiveness.. - Schapire, Freund et al. - 1997
216   Very simple classification rules perform well on most common.. (context) - Holte - 1993
203   Multi-interval discretization of continuous-valued attribute.. (context) - Fayyad, Irani - 1993
180   Boosting a weak learning algorithm by majority - Freund - 1990
180   Boosting a weak learning algorithm by majority - Freund - 1996
164   A study of cross-validation and bootstrap for accuracy estim.. - Kohavi
121   An analysis of Bayesian classifiers - Langley, Iba et al. - 1992
116   Beyond independence: Conditions for the optimality of the si.. - Domingos, Pazzani - 1997
107   Approximate statistical tests for comparing supervised class.. - Dietterich - 1998
105   Estimating probabilities: A crucial task in machine learning (context) - Cestnik - 1990
84   A conservation law for generalization performance (context) - Schaffer - 1994
83   Learning classification trees - Buntine
82   Error-correcting output coding corrects bias and variance - Kong, Dietterich - 1995
80   Bias plus variance decomposition for zero-one loss functions - Kohavi, Wolpert - 1996
70   University of California (context) - Breiman
60   A Theory of Learning Classification Rules - Buntine
58   The Estimation of Probabilities: An Essay on Modern Bayesian.. (context) - Good - 1965
57   Multiple decision trees (context) - Kwok, Carter - 1990
54   Error-correcting output codes: A general method for improvin.. - Dietterich, Bakiri - 1991
51   Wrappers for Performance Enhancement and Oblivious Decision .. - Kohavi
48   Data mining using MLC++ : A machine learning library in C - Kohavi, Sommerfield et al. - 1997
42   Boosting decision trees (context) - Drucker, Cortes - 1996
41   Reducing misclassification costs (context) - Pazzani, Merz et al. - 1994
41   Error-based and entropy-based discretization of continuous f.. - Kohavi, Sahami - 1996
34   Heuristics of instability in model selection (context) - Breiman - 1994
33   Comparing connectionist and symbolic learning methods - Quinlan - 1994
25   On pruning and averaging decision trees - Oliver, Hand - 1995
25   Feature subset selection using the wrapper model: Overfittin.. (context) - Kohavi, Sommerfield - 1995
24   Option decision trees with majority votes - Kohavi, Kunz - 1997
23   Learning Probabilistic Relational Concept Descriptions (context) - Ali - 1996
23   The effects of training set size on decision tree complexity - Oates, Jensen - 1997
22   Induction of one-level decision trees - Iba, Langley - 1992
21   Learning symbolic rules using artificial neural networks - Craven, Shavlik - 1993
21   Boosting and Naive Bayesian learning - Elkan - 1997
19   The relationship between PAC (context) - Wolpert - 1994
10   Scaling to domains with many irrelevant features (context) - Langley, Sage - 1997
9   Integrating multiple learned models for improving and scalin.. (context) - Chan, Stolfo et al. - 1996
9   Interpretable boosted naive bayes classification (context) - Ridgeway, Madigan et al. - 1998
9   Visualizing the simple bayesian classifier - Becker, Kohavi et al. - 1997
8   Arcing the edge - Breiman - 1997
8   Why does bagging work (context) - Domingos - 1997
4   On bias, variance, 0/1-loss, and the curse of dimensionality (context) - Friedman - 1997
2   Improving Simple Bayes (context) - OF, BAGGING et al. - 1997



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www-connex.lip6.fr/~amini/PageRessource.html):   More
QALC - the Question-Answering program of the.. - Ferret, Grau..   (Correct)
Sentence Extraction as a Classification Task - Teufel, Moens (1997)   (Correct)
TextTiling: A Quantitative Approach to Discourse Segmentation - Hearst (1993)   (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