Boosting the margin: a new explanation for the effectiveness of voting methods
type: Item
instance of: scholarly article
title: Boosting the margin: a new explanation for the effectiveness of voting methods
zbMATH Open document ID: 0929.62069
author: Robert E. Schapire
author: Yoav Freund
author: Wee Sun Lee
author: Peter L. Bartlett
published in: The Annals of Statistics
publication date: 1999-11-09T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 65C60
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1359588
zbMATH Keywords: ensemble methods
zbMATH Keywords: decision trees
zbMATH Keywords: bagging
zbMATH Keywords: error-correcting
zbMATH Keywords: output
zbMATH Keywords: coding
zbMATH Keywords: Markov chain Monte Carlo
zbMATH Keywords: boosting
zbMATH Keywords: neural networks
describes a project that uses: UCI-ml
describes a project that uses: C4.5
describes a project that uses: AdaBoost.MH
MaRDI profile type: Publication
Wikidata QID: Q115720343
full work available at URL: https://doi.org/10.1214/aos/1024691352
OpenAlex ID: W1975846642
cites work: Universal approximation bounds for superpositions of a sigmoidal function
cites work: The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
cites work: An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
cites work: Bagging predictors
cites work: Arcing classifiers. (With discussion)
cites work: Q3327527
cites work: Support-vector networks
cites work: Bounds for the uniform deviation of empirical measures
cites work: Q4386929
cites work: Rates of convex approximation in non-Hilbert spaces
cites work: Boosting a weak learning algorithm by majority
cites work: A decision-theoretic generalization of on-line learning and an application to boosting
cites work: Adaptive game playing using multiplicative weights
cites work: A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
cites work: Reducing multiclass to binary: A unifying approach for margin classifiers
cites work: Efficient agnostic learning of neural networks with bounded fan-in
cites work: The importance of convexity in learning with squared loss
cites work: Q4260443
cites work: Q4386942
cites work: On the density of families of sets
cites work: Improved boosting algorithms using confidence-rated predictions
cites work: Q4856771
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
DOI: 10.1214/AOS/1024691352
description: scientific article; zbMATH DE number 1359588