Robust ensemble learning for data mining

Gunnar Rätsch; Bernhard Schölkopf; Alexander Johannes Smola; Sebastian Mika; Takashi Onoda; Klaus Robert Müller

doi:10.1007/3-540-45571-x_39

Robust ensemble learning for data mining

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

15 Citations (Scopus)

Abstract

We propose a new boosting algorithm which similaxly 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.

Original language	English
Title of host publication	Knowledge Discovery and Data Mining
Subtitle of host publication	Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings
Editors	Takao Terano, Huan Liu, Arbee L.P. Chen
Publisher	Springer Verlag
Pages	341-344
Number of pages	4
ISBN (Print)	3540673822, 9783540673828
DOIs	https://doi.org/10.1007/3-540-45571-x_39
Publication status	Published - 2000
Event	4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000 - Kyoto, Japan Duration: 2000 Apr 18 → 2000 Apr 20

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1805
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000
Country/Territory	Japan
City	Kyoto
Period	00/4/18 → 00/4/20

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-45571-x_39

Cite this

Rätsch, G., Schölkopf, B., Smola, A. J., Mika, S., Onoda, T., & Müller, K. R. (2000). Robust ensemble learning for data mining. In T. Terano, H. Liu, & A. L. P. Chen (Eds.), Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings (pp. 341-344). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1805). Springer Verlag. https://doi.org/10.1007/3-540-45571-x_39

Robust ensemble learning for data mining. / Rätsch, Gunnar; Schölkopf, Bernhard; Smola, Alexander Johannes et al.

Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. ed. / Takao Terano; Huan Liu; Arbee L.P. Chen. Springer Verlag, 2000. p. 341-344 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1805).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Rätsch, G, Schölkopf, B, Smola, AJ, Mika, S, Onoda, T & Müller, KR 2000, Robust ensemble learning for data mining. in T Terano, H Liu & ALP Chen (eds), Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1805, Springer Verlag, pp. 341-344, 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000, Kyoto, Japan, 00/4/18. https://doi.org/10.1007/3-540-45571-x_39

Rätsch G, Schölkopf B, Smola AJ, Mika S, Onoda T, Müller KR. Robust ensemble learning for data mining. In Terano T, Liu H, Chen ALP, editors, Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. Springer Verlag. 2000. p. 341-344. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45571-x_39

Rätsch, Gunnar ; Schölkopf, Bernhard ; Smola, Alexander Johannes et al. / Robust ensemble learning for data mining. Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. editor / Takao Terano ; Huan Liu ; Arbee L.P. Chen. Springer Verlag, 2000. pp. 341-344 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3fb5b031c1dc4d91b6d506d581b5f2db,

title = "Robust ensemble learning for data mining",

abstract = "We propose a new boosting algorithm which similaxly 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.",

author = "Gunnar R{\"a}tsch and Bernhard Sch{\"o}lkopf and Smola, {Alexander Johannes} and Sebastian Mika and Takashi Onoda and M{\"u}ller, {Klaus Robert}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000 ; Conference date: 18-04-2000 Through 20-04-2000",

year = "2000",

doi = "10.1007/3-540-45571-x_39",

language = "English",

isbn = "3540673822",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "341--344",

editor = "Takao Terano and Huan Liu and Chen, {Arbee L.P.}",

booktitle = "Knowledge Discovery and Data Mining",

}

TY - GEN

T1 - Robust ensemble learning for data mining

AU - Rätsch, Gunnar

AU - Schölkopf, Bernhard

AU - Smola, Alexander Johannes

AU - Mika, Sebastian

AU - Onoda, Takashi

AU - Müller, Klaus Robert

PY - 2000

Y1 - 2000

N2 - We propose a new boosting algorithm which similaxly 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.

AB - We propose a new boosting algorithm which similaxly 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.

UR - http://www.scopus.com/inward/record.url?scp=84869096933&partnerID=8YFLogxK

U2 - 10.1007/3-540-45571-x_39

DO - 10.1007/3-540-45571-x_39

M3 - Conference contribution

AN - SCOPUS:84869096933

SN - 3540673822

SN - 9783540673828

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 341

EP - 344

BT - Knowledge Discovery and Data Mining

A2 - Terano, Takao

A2 - Liu, Huan

A2 - Chen, Arbee L.P.

PB - Springer Verlag

T2 - 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000

Y2 - 18 April 2000 through 20 April 2000

ER -

Robust ensemble learning for data mining

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this