Skip to main content

2000 | OriginalPaper | Buchkapitel

Robust Ensemble Learning for Data Mining

verfasst von : Gunnar Rätsch, Bernhard Schölkopf, Alexander Johannes Smola, Sebastian Mika, Takashi Onoda, Klaus-Robert Müller

Erschienen in: Knowledge Discovery and Data Mining. Current Issues and New Applications

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

We propose a new boosting algorithm which similarly to v-Support-Vector Classification allows for the possibility of a pre-specified fraction v of points to lie in the margin area or even on the wrong side of the decision boundary. It gives a nicely interpretable way of controlling the trade-off between minimizing training error and capacity. Furthermore, it can act as a filter for finding and selecting informative patterns from a database.

Metadaten
Titel
Robust Ensemble Learning for Data Mining
verfasst von
Gunnar Rätsch
Bernhard Schölkopf
Alexander Johannes Smola
Sebastian Mika
Takashi Onoda
Klaus-Robert Müller
Copyright-Jahr
2000
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-45571-X_39

Premium Partner