(Enter summary)
Abstract: . One of the surprising recurring phenomena
observed in experiments with boosting is that the test error
of the generated hypothesis usually does not increase as its
size becomes very large, and often is observed to decrease
even after the training error reaches zero. In this paper, we
show that this phenomenon is related to the distribution of
margins of the training examples with respect to the generated
voting classification rule, where the margin of an
example is simply the difference... (Update)
Cited by: More
Managing Domain Knowledge and Multiple Models with Boosting - Peng Zang Georgia
(Correct)
A Simple Additive Re-weighting Strategy for Improving Margins - Fabio Aiolli And
(Correct)
Heterogenous Committees with Competence Analysis - Norbert Jankowski Krzysztof
(Correct)
Similar documents (at the sentence level):
51.0%: Boosting the Margin: A New Explanation for the.. - Schapire, Freund.. (1998)
(Correct)
Active bibliography (related documents): More All
0.2: An Experimental and Theoretical Comparison of Model.. - Kearns, Mansour, Ng, Ron
(Correct)
0.2: Discussion of the paper "Arcing Classifiers" by Leo Breiman - Freund, Schapire (1997)
(Correct)
0.2: The Sample Complexity of Pattern Classification With Neural.. - Bartlett (1997)
(Correct)
Similar documents based on text: More All
0.5: Optimal Artificial Neural Network Architecture Selection.. - Andersen, Rimer, Martinez
(Correct)
0.4: Efficient Margin Maximizing with Boosting - Rätsch, Warmuth (2002)
(Correct)
0.3: The Alternating Decision Tree Learning Algorithm - Freund, Mason (1999)
(Correct)
Related documents from co-citation: More All
52: Experiments with a New Boosting Algorithm
- Freund, Schapire - 1996
40: A decision-theoretic generalization of on-line learning and an application to bo..
- Freund, Schapire - 1997
30: Programs for machine learning (context) - Quinlan - 1993
BibTeX entry: (Update)
Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. In Machine Learning: Proceedings of the Fourteenth International Conference, 1997. http://citeseer.ist.psu.edu/schapire97boosting.html More
@inproceedings{ schapire97boosting,
author = "Robert E. Schapire and Yoav Freund and Peter Bartlett and Wee Sun Lee",
title = "Boosting the margin: a new explanation for the effectiveness of voting methods",
booktitle = "Proc. 14th International Conference on Machine Learning",
publisher = "Morgan Kaufmann",
pages = "322--330",
year = "1997",
url = "citeseer.ist.psu.edu/schapire97boosting.html" }
Citations (may not include all citations):
657
Bagging predictors
- Breiman - 1996
524
Support-vector networks
- Cortes, Vapnik - 1995
509
A decision-theoretic generalization of on-line learning and ..
- Freund, Schapire
500
Experiments with a new boosting algorithm
- Freund, Schapire - 1996
255
A training algorithm for optimal margin classifiers
- Boser, Guyon et al. - 1992
203
What size net gives valid generalization (context) - Baum, Haussler - 1989
183
Solving multiclass learning problems via error-correcting ou..
- Dietterich, Bakiri - 1995
180
Boosting a weak learning algorithm by majority
- Freund - 1995
89
and arcing classifiers (context) - Breiman, variance - 1996
80
Bias plus variance decomposition for zero-one loss functions
- Kohavi, Wolpert - 1996
45
line prediction and boosting (context) - Freund, Schapire et al. - 1996
42
Boosting decision trees (context) - Drucker, Cortes - 1996
37
Structural risk minimization over datadependent hierarchies (context) - Shawe-Taylor, Bartlett et al. - 1996
23
variance and prediction error for classification rules (context) - Tibshirani - 1996
12
the size of the weights is more important than the size of t.. (context) - Bartlett, generalization - 1997
11
A framework for structural risk minimisation
- Shawe-Taylor, Bartlett et al. - 1996
8
Error-correcting output coding corrects bias and variance
- Kong, Dietterich - 1995
4
Estimation of DependencesBased on Empirical Data (context) - Vapnik - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wwwsyseng.anu.edu.au/~bartlett/abstracts.html): More
The Complexity of Model Classes, and Smoothing Noisy Data - Peter Bartlett (1996)
(Correct)
Learning Changing Concepts by Exploiting the Structure of Change - Peter Bartlett (1996)
(Correct)
Almost Linear VC Dimension Bounds for Piecewise Polynomial .. - Bartlett, Maiorov, Meir (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