English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Regularizing AdaBoost

Rätsch, G., Onoda, T., & Müller, K.-R. (1999). Regularizing AdaBoost. In M. Kearns, S. Solla, & D. Cohn (Eds.), Advances in Neural Information Processing Systems 11 (pp. 564-570). Cambridge, MA, USA: MIT Press.

Item is

Files

show Files

Locators

show
hide
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Rätsch, G1, Author           
Onoda, T, Author
Müller, K-R1, Author           
Affiliations:
1External Organizations, ou_persistent22              

Content

show
hide
Free keywords: -
 Abstract: Boosting methods maximize a hard classification margin and are known as powerful techniques that do not exhibit overfitting for low noise cases. Also for noisy data boosting will try to enforce a hard margin and thereby give too much weight to outliers, which then leads to the dilemma of non-smooth fits and overfitting. Therefore we propose three algorithms to allow for soft margin classification by introducing regularization with slack variables into the boosting concept: (1) AdaBoost reg and regularized versions of (2) linear and (3) quadratic programming AdaBoost. Experiments show the usefulness of the proposed algorithms in comparison to another soft margin classifier: the support vector machine.

Details

show
hide
Language(s):
 Dates: 1999-05
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: 2186
 Degree: -

Event

show
hide
Title: Twelfth Annual Conference on Neural Information Processing Systems (NIPS 1998)
Place of Event: Denver, CO, USA
Start-/End Date: 1998-11-30 - 1998-12-05

Legal Case

show

Project information

show

Source 1

show
hide
Title: Advances in Neural Information Processing Systems 11
Source Genre: Proceedings
 Creator(s):
Kearns, MJ, Editor
Solla, SA, Editor
Cohn, DA, Editor
Affiliations:
-
Publ. Info: Cambridge, MA, USA : MIT Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 564 - 570 Identifier: ISBN: 0-262-11245-0