Efficient Margin Maximizing with Boosting

Efficient Margin Maximizing with Boosting (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Gunnar Rätsch , Manfred K. Warmuth , Pack Kaelbling

Citations:

26 - 6 self

BibTeX

@MISC{Rätsch02efficientmargin,
    author = {Gunnar Rätsch and Manfred K. Warmuth and Pack Kaelbling},
    title = {Efficient Margin Maximizing with Boosting},
    year = {2002}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

AdaBoost produces a linear combination of base hypotheses and predicts with the sign of this linear combination. It has been observed that the generalization error of the algorithm continues to improve even after all examples are classified correctly by the current signed linear combination, which can be viewed as hyperplane in feature space where the base hypotheses form the features.

Citations

4072	JR: C4.5: Programs for Machine Learning - Quinlan
1714	Schapire R: A decision-theoretic generalization of online learning and an application to boosting - Freund - 1997
1326	Schapire R: Experiments with a new boosting algorithm - Freund
607	W: Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statisics - Schapire, Freund, et al. - 1998
358	Boosting a weak learning algorithm by majority - Freund - 1995
199	Soft margins for AdaBoost - Ratsch, Onoda, et al. - 1998
168	Multiple kernel learning, conic duality, and the SMO algorithm - Bach, Lanckriet, et al. - 2004
142	Zur Theorie der Gesellschaftsspiele - Neumann - 1928
113	Prediction games and arcing algorithms - Breiman - 1997
106	Adaptive game playing using multiplicative weights - Freund, Schapire - 1999
81	A statistical framework for genomic data fusion - Lanckriet - 2004
80	Semi-infinite programming: Theory, methods, and applications - Hettich, Kortanek - 1993
72	Linear and nonlinear programming - Nash, Sofer - 1996
57	The Design and Analysis of Efficient Learning Algorithms - Schapire - 1991
51	Boosting as entropy projection - Kivinen, Warmuth - 1999
40	An Introduction to the Bootstrap, volume 57 - Efron, Tibshirani - 1993
36	Additive models, boosting, and inference for generalized divergences - Lafferty - 1999
33	Arbitrary-norm separating plane - Mangasarian - 1999
32	A column generation algorithm for boosting - Bennett, Demiriz, et al. - 2000
29	Constructing boosting algorithms from svms: An application to one-class classification - Rätsch, Mika, et al.
24	Learning interpretable SVMs for biological sequence classification - Sonnenburg, Rätsch, et al. - 2005
22	The dynamics of adaboost: Cyclic behavior and convergence of margins - Rudin, Daubechies, et al.
21	ªSparse Regression Ensembles in Infinite and Finite Hypothesis Spaces,º - RaÈtsch, Demiriz, et al. - 2002
17	Robust boosting via convex optimization - Rätsch - 2001
16	Boosting first-order learning - Quinlan - 1996
14	Maximizing the margin with boosting - Rätsch, Warmuth - 2002
11	Zur theorie der gesellschaftsspiele - Neumann - 1928
11	Sparse regression ensembles in infinite and finite hypothesis spaces - Rätsch, Demiriz, et al. - 2002
8	On the dynamics of boosting - Rudin, Daubechies, et al. - 2004
5	2000b) Some new bounds on the generalization error of combined classifiers - Koltchinskii, Panchenko, et al.
2	Analysis of boosting algoritms using the smooth margin function: A study of three algorithms. Unpublished manuscript - Rudin, Schapire, et al. - 2004
1	Are margins relevant in voting? Talk at the - Breiman - 1998
1	Robust Boosting via Convex Optimization - Ritsch - 2001