Back to search

Boosting the margin: a new explanation for the effectiveness of voting methods

Data up to Jan 2025

Published1998
Citations2,338
References43

Total Citations Per Year

Abstract

References (43)

The Nature of Statistical Learning Theory

1995 • 38,742 citations

Support-vector networks

1995 • 35,844 citations

Untitled

1995 • 29,657 citations

Classification and Regression Trees.

1984 • 23,117 citations

A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting

1997 • 18,426 citations

Untitled

1996 • 16,093 citations

A training algorithm for optimal margin classifiers

1992 • 11,054 citations

Experiments with a new boosting algorithm

1996 • 7,607 citations

Untitled

1990 • 3,286 citations

On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

2015 • 3,217 citations

Untitled

2000 • 2,828 citations

Universal approximation bounds for superpositions of a sigmoidal function

1993 • 2,713 citations

Solving Multiclass Learning Problems via Error-Correcting Output Codes

1995 • 2,697 citations

Improved boosting algorithms using confidence-rated predictions

1998 • 2,601 citations

UCI Repository of Machine Learning Databases

1996 • 2,400 citations

On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

1971 • 2,313 citations

Estimation of Dependences Based on Empirical Data

2006 • 2,270 citations

The strength of weak learnability

1990 • 2,267 citations

Boosting a Weak Learning Algorithm by Majority

1995 • 1,633 citations

What Size Net Gives Valid Generalization?

1989 • 1,555 citations

Bagging, boosting, and C4.S

1996 • 1,308 citations

The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

1998 • 1,189 citations

Heuristics of instability and stabilization in model selection

1996 • 1,136 citations

Arcing classifier (with discussion and a rejoinder by the author)

1998 • 1,063 citations

On the density of families of sets

1972 • 884 citations

Bias plus variance decomposition for zero-one loss functions

1996 • 614 citations

Improving Regressors using Boosting Techniques

1997 • 548 citations

Structural risk minimization over data-dependent hierarchies

1998 • 536 citations

Adaptive Game Playing Using Multiplicative Weights

1999 • 533 citations

A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network Training

1992 • 476 citations

Game theory, on-line prediction and boosting

1996 • 376 citations

Error-Correcting Output Coding Corrects Bias and Variance

1995 • 356 citations

Using output codes to boost multiclass learning problems

1997 • 262 citations

An empirical evaluation of bagging and boosting

1997 • 248 citations

Boosting in the limit: maximizing the margin of learned ensembles

1998 • 238 citations

Boosting Decision Trees

1995 • 234 citations

Efficient agnostic learning of neural networks with bounded fan-in

1996 • 167 citations

The importance of convexity in learning with squared loss

1998 • 103 citations

Rates of convex approximation in non-hilbert spaces

1997 • 90 citations

A framework for structural risk minimisation

1996 • 79 citations

Bounds for the uniform deviation of empirical measures

1982 • 67 citations

Asymptotic distribution of the errors in scalar and vector quantizers

1996 • 62 citations

An optimal algorithm for multiplication in F256/F4

1991 • 23 citations

Cited By (0)

Loading...
Boosting the margin: a new explanation for the effectiveness of voting methods (1998) – The Annals of Statistics | Metascience Observatory Explorer