The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Online Bagging and Boosting for Imbalanced Data Streams
Abstract
While both cost-sensitive learning and online learning have been studied separately, these two issues have seldom been addressed simultaneously. Yet, there are many applications where both aspects are important. This paper investigates a class of algorithmic approaches suitable for online cost-sensitive learning, designed for such problems. The basic idea is to leverage existing methods for online ensemble algorithms, and combine these with batch mode methods for cost-sensitive bagging/boosting algorithms. Within this framework, we describe several theoretically sound online cost-sensitive bagging and online cost-sensitive boosting algorithms, and show that the convergence of the proposed algorithms is guaranteed under certain conditions. We then present extensive experimental results on benchmark datasets to compare the performance of the various proposed approaches.
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
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865
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
He, H., & Garcia, E. A. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.239 · Cited by 10,359
Measures of Diversity in Classifier Ensembles and Their Relationship with the Ensemble Accuracy
Kuncheva, L. I., & Whitaker, C. J. (2003) · Machine Learning · doi:10.1023/a:1022859003006 · Cited by 2,335 · cited 1×
“In this section, we briefly review the standard bagging and boosting algorithms, as well as their online versions and cost-sensitive versions, which motivate the proposed online cost-sensitive ensemble framework.”
Background
Cited by
Learning from class-imbalanced data: Review of methods and applications
Haixiang, G., Yijing, L., Shang, J., Mingyun, G., Yuanyue, H., & Bing, G. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.12.035 · Cited by 2,377
A survey on imbalanced learning: latest research, applications and future directions
Chen, W., Yang, K., Yu, Z., Shi, Y., & Chen, C. L. P. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10759-6 · Cited by 506
Zhang, F., Kodituwakku, H. A. D. E., Hines, J. W., & Coble, J. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2891261 · Cited by 362
A Cost-Sensitive Deep Belief Network for Imbalanced Classification
Zhang, C., Tan, K. C., Li, H., & Hong, G. S. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2832648 · Cited by 282
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
“Online AdaBoost (OADA) [39] It is an online version of the AdaBoost algorithm; it updates the model with new data, adjusting weights of incorrectly classified instances to improve performance.”
Metadata
- Authors
- Wang, B., & Pineau, J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2016-12-01
- Volume
- 28
- Issue
- 12
- Pages
- 3353-3366
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2520599539
- Cited by
- 181
- References
- 4
- FWCI
- 9.68
- Type
- journal article
- 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 for Imbalanced Data Streams. https://app.cochat.ai/papers/10.1109/tkde.2016.2609424
- The paper
- Wang, B., & Pineau, J. (2016). Online Bagging and Boosting for Imbalanced Data Streams. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2016.2609424
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.