The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Online Bagging and Boosting
Abstract
Bagging and boosting are two of the most well-known ensemble learning methods due to their theoretical performance guarantees and strong experimental results. However, these algorithms have been used mainly in batch mode, i.e., they require the entire training set to be available at once and, in some cases, require random access to the data. In this paper, we present online versions of bagging and boosting that require only one pass through the training data. We build on previously presented work by describing some theoretical results. We also compare the online and batch algorithms experimentally in terms of accuracy and running time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Oza, N. C., & Russell, S. (2001) · NASA Technical Reports Server (NASA) · Cited by 330
Self-citationExperimental comparisons of online and batch versions of bagging and boosting
Oza, N. C., & Russell, S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502565 · Cited by 244
Self-citationOza, N. C. (2000) · National Conference on Artificial Intelligence · Cited by 195
Self-citationOnline Ensemble Learning: An Empirical Study
Fern, A., & Givan, R. L. (2003) · Machine Learning · doi:10.1023/a:1025619426553 · Cited by 148
Lossless Online Bayesian Bagging
Lee, H. K. H., & Clyde, M. A. (2004) · DukeSpace (Duke University) · doi:10.5555/1005332.1005337 · Cited by 33
Cited by
Sagi, O., & Rokach, L. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1249 · Cited by 3,103
Ensemble deep learning: A review
Ganaie, M. A., Hu, M., Malik, A. K., Tanveer, M., & Suganthan, P. N. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105151 · Cited by 2,143
Grabner, H., & Bischof, H. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.215 · Cited by 979
Adaptive random forests for evolving data stream classification
Gomes, H. M., Bifet, A., Read, J., Barddal, J. P., Enembreck, F., Pfharinger, B., Holmes, G., & Abdessalem, T. (2017) · Machine Learning · doi:10.1007/s10994-017-5642-8 · Cited by 805
Fraud detection system: A survey
Abdallah, A., Maarof, M. A., & Zainal, A. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.04.007 · Cited by 708
Ren, Y., Zhang, L., & Suganthan, P. N. (2016) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2015.2471235 · Cited by 675
A Survey on Ensemble Learning for Data Stream Classification
Gomes, H. M., Barddal, J. P., Enembreck, F., & Bifet, A. (2018) · ACM Computing Surveys · doi:10.1145/3054925 · Cited by 579
Learned lessons in credit card fraud detection from a practitioner perspective
Dal Pozzolo, A., Caelen, O., Le Borgne, Y.-A., Waterschoot, S., & Bontempi, G. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.02.026 · Cited by 530
DDD: A New Ensemble Approach for Dealing with Concept Drift
Minku, L. L., & Yao, X. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.58 · Cited by 431
Resampling-Based Ensemble Methods for Online Class Imbalance Learning
Wang, S., Minku, L. L., & Yao, X. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2345380 · Cited by 396
Deep learning for load forecasting with smart meter data: Online Adaptive Recurrent Neural Network
Fekri, M. N., Patel, H., Grolinger, K., & Sharma, V. (2021) · Applied Energy · doi:10.1016/j.apenergy.2020.116177 · Cited by 382
Genuer, R., Poggi, J.-M., Tuleau-Malot, C., & Villa-Vialaneix, N. (2017) · Big Data Research · doi:10.1016/j.bdr.2017.07.003 · Cited by 367
A Systematic Study of Online Class Imbalance Learning With Concept Drift
Wang, S., Minku, L. L., & Yao, X. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2771290 · Cited by 331
A survey on data stream clustering and classification
Nguyen, H.-L., Woon, Y.-K., & Ng, W.-K. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-014-0808-1 · Cited by 321
InterruptMe: designing intelligent prompting mechanisms for pervasive applications
Pejovic, V., & Musolesi, M. (2014) · Proceedings of the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing · doi:10.1145/2632048.2632062 · Cited by 282
Scikit-Multiflow: A Multi-output Streaming Framework
Montiel, J., Read, J., Bifet, A., & Abdessalem, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.04662 · Cited by 271
Machine learning for streaming data: state of the art, challenges, and opportunities
Gomes, H. M., Read, J., Bifet, A., Barddal, J. P., & Gama, J. (2019) · ACM SIGKDD Explorations Newsletter · doi:10.1145/3373464.3373470 · Cited by 267
FAHT: An Adaptive Fairness-aware Decision Tree Classifier
Zhang, W., & Ntoutsi, E. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/205 · Cited by 85
Class balancing diversity multimodal ensemble for Alzheimer’s disease diagnosis and early detection
Francesconi, A., di Biase, L., Cappetta, D., Rebecchi, F., Soda, P., Sicilia, R., & Guarrasi, V. (2025) · Computerized Medical Imaging and Graphics · doi:10.1016/j.compmedimag.2025.102529 · Cited by 30
“Oversampling Online Bagging (OOB) [41] It is an adaptation of the Online Bagging algo-rithm (OB [42]) that incorporates oversampling techniques, by focusing on increasing the representation of minority classes.”
Metadata
- Authors
- Oza, N. C.
- Venue
- 2005 IEEE International Conference on Systems, Man and Cybernetics
- Publisher
- IEEE
- Published
- 2006-01-18
- Volume
- 3
- Pages
- 2340-2345
- ISSN
- 1062-922X (ISSN-L)
- OpenAlex
- W1529840045
- Cited by
- 569
- References
- 7
- FWCI
- 10.57
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.