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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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) · Cited by 189
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
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
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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Online Bagging and Boosting. https://app.cochat.ai/papers/10.1109/icsmc.2005.1571498
- The paper
- Oza, N. C. (2006). Online Bagging and Boosting. 2005 IEEE International Conference on Systems, Man and Cybernetics. https://doi.org/10.1109/icsmc.2005.1571498
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.