Nowadays, every device connected to the Internet generates an ever-growing stream of data (formally, unbounded). Machine Learning on unbounded data streams is a grand challenge due to its resource constraints. In fact, standard machine learning techniques are not able to deal with data whose statistics is subject to gradual or sudden changes without any warning. Massive Online Analysis (MOA) is the collective name, as well as a software library, for new learners that are able to manage data streams. In this paper, we present a research study on streaming rebalancing. Indeed, data streams can be imbalanced as static data, but there is not a method to rebalance them incrementally, one element at a time. For this reason we propose a new streaming approach able to rebalance data streams online. Our new methodology is evaluated against some synthetically generated datasets using prequential evaluation in order to demonstrate that it outperforms the existing approaches.
[1]
Geoff Holmes,et al.
Pitfalls in Benchmarking Data Stream Classification and How to Avoid Them
,
2013,
ECML/PKDD.
[2]
Nitesh V. Chawla,et al.
SMOTE: Synthetic Minority Over-sampling Technique
,
2002,
J. Artif. Intell. Res..
[3]
Geoff Hulten,et al.
Mining time-changing data streams
,
2001,
KDD '01.
[4]
Alexey Tsymbal,et al.
The problem of concept drift: definitions and related work
,
2004
.
[5]
Geoff Hulten,et al.
Mining high-speed data streams
,
2000,
KDD '00.
[6]
Albert Bifet,et al.
Efficient Online Evaluation of Big Data Stream Classifiers
,
2015,
KDD.
[7]
Talel Abdessalem,et al.
Adaptive random forests for evolving data stream classification
,
2017,
Machine Learning.
[8]
Ricard Gavaldà,et al.
Adaptive Learning from Evolving Data Streams
,
2009,
IDA.
[9]
Ricard Gavaldà,et al.
Learning from Time-Changing Data with Adaptive Windowing
,
2007,
SDM.
[10]
Leo Breiman,et al.
Random Forests
,
2001,
Machine Learning.