Boosting the margin: a new explanation for the effectiveness of voting methods
Open Access
- 1 October 1998
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Statistics
- Vol. 26 (5)
- https://doi.org/10.1214/aos/1024691352
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- 10.1162/15324430152733133Applied Physics Letters, 2000
- The importance of convexity in learning with squared lossIEEE Transactions on Information Theory, 1998
- Arcing classifier (with discussion and a rejoinder by the author)The Annals of Statistics, 1998
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- Asymptotic distribution of the errors in scalar and vector quantizersIEEE Transactions on Information Theory, 1996
- Support-vector networksMachine Learning, 1995
- Universal approximation bounds for superpositions of a sigmoidal functionIEEE Transactions on Information Theory, 1993
- A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network TrainingThe Annals of Statistics, 1992
- An optimal algorithm for multiplication in F256/F4Applicable Algebra in Engineering, Communication and Computing, 1991
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972