Hybrid Forest: A Concept Drift Aware Data Stream Mining Algorithm
Nowadays with a growing number of online controlling systems in the organization and also a high demand of monitoring and stats facilities that uses data streams to log and control their subsystems, data stream mining becomes more and more vital. Hoeffding Trees (also called Very Fast Decision Trees...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Nowadays with a growing number of online controlling systems in the
organization and also a high demand of monitoring and stats facilities that
uses data streams to log and control their subsystems, data stream mining
becomes more and more vital. Hoeffding Trees (also called Very Fast Decision
Trees a.k.a. VFDT) as a Big Data approach in dealing with the data stream for
classification and regression problems showed good performance in handling
facing challenges and making the possibility of any-time prediction. Although
these methods outperform other methods e.g. Artificial Neural Networks (ANN)
and Support Vector Regression (SVR), they suffer from high latency in adapting
with new concepts when the statistical distribution of incoming data changes.
In this article, we introduced a new algorithm that can detect and handle
concept drift phenomenon properly. This algorithms also benefits from fast
startup ability which helps systems to be able to predict faster than other
algorithms at the beginning of data stream arrival. We also have shown that our
approach will overperform other controversial approaches for classification and
regression tasks. |
---|---|
DOI: | 10.48550/arxiv.1902.03609 |