PAPER DIGEST
Most Influential KDD 2001 Paper · 2026-03 edition

Experimental Comparisons Of Online And Batch Versions Of Bagging And Boosting

Nikunj C. Oza; Stuart Russell

Venue
ACM SIGKDD Conference (KDD) 2001
Recognition
Most Influential KDD 2001 Paper (Rank No. 13)
Edition
2026-03
Impact factor
5
Certificate ID
7e962a0309249edb

Abstract

<i>Bagging</i> and <i>boosting</i> are well-known ensemble learning methods. They combine multiple learned base models with the aim of improving generalization performance. To date, they have been used primarily in <i>batch</i> mode, i.e., they require multiple passes through the training data. In previous work, we presented online bagging and boosting algorithms that only require one pass through the training data and presented experimental results on some relatively small datasets. Through additional experiments on a variety of larger synthetic and real datasets, this paper demonstrates that our online versions perform comparably to their batch counterparts in terms of classification accuracy. We also demonstrate the substantial reduction in running time we obtain with our online algorithms because they require fewer passes through the training data.

Download PDF certificate