Improving Online Bagging for Complex Imbalanced Data Stream

Bartosz Przybyl, Jerzy Stefanowski
10/4/2024
cs.LG

No confident code implementation found for this paper.

Abstract

Learning classifiers from imbalanced and concept drifting data streams is still a challenge. Most of the current proposals focus on taking into account changes in the global imbalance ratio only and ignore the local difficulty factors, such as the minority class decomposition into sub-concepts and the presence of unsafe types of examples (borderline or rare ones). As the above factors present in the stream may deteriorate the performance of popular online classifiers, we propose extensions of resampling online bagging, namely Neighbourhood Undersampling or Oversampling Online Bagging to take better account of the presence of unsafe minority examples. The performed computational experiments with synthetic complex imbalanced data streams have shown their advantage over earlier variants of online bagging resampling ensembles.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{przybyl2024improving,
  title  = {Improving Online Bagging for Complex Imbalanced Data Stream},
  author = {Bartosz Przybyl and Jerzy Stefanowski},
  year   = {2024},
  eprint = {2410.03519},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.03519v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.03519.svg)](https://codeofpaper.com/paper/2410.03519)

Discussion