Research Commons

Leveraging bagging for evolving data streams

Research Commons

Show simple item record

dc.contributor.author Bifet, Albert
dc.contributor.author Holmes, Geoffrey
dc.contributor.author Pfahringer, Bernhard
dc.date.accessioned 2010-10-01T00:28:15Z
dc.date.available 2010-10-01T00:28:15Z
dc.date.issued 2010
dc.identifier.citation Bifet, A., Holmes, G. & Pfahringer, B. (2010). Leveraging bagging for evolving data streams. In J.L. alcazer et al. (Eds.): ECML PKDD 2010, Part I, LNZI 6321 (pp. 135-150). Heidelberg: Springer-Verlag. en_NZ
dc.identifier.uri http://hdl.handle.net/10289/4638
dc.description.abstract Bagging, boosting and Random Forests are classical ensemble methods used to improve the performance of single classifiers. They obtain superior performance by increasing the accuracy and diversity of the single classifiers. Attempts have been made to reproduce these methods in the more challenging context of evolving data streams. In this paper, we propose a new variant of bagging, called leveraging bagging. This method combines the simplicity of bagging with adding more randomization to the input, and output of the classifiers. We test our method by performing an evaluation study on synthetic and real-world datasets comprising up to ten million examples. en_NZ
dc.language.iso en
dc.publisher Springer-Verlag en_NZ
dc.relation.uri http://www.springerlink.com/content/04656721q4485837/ en_NZ
dc.subject computer science en_NZ
dc.subject data stream en_NZ
dc.subject bagging en_NZ
dc.subject boosting en_NZ
dc.subject Random Forest en_NZ
dc.title Leveraging bagging for evolving data streams en_NZ
dc.type Conference Contribution en_NZ


Full-text options:

This item appears in the following Collection(s)

Show simple item record

Search Research Commons


Advanced Search

Browse

Theses

About Research Commons

My Account

Usage Statistics

Share

  • Bookmark and Share