Forgetful Forests: high performance learning data structures for streaming data under concept drift

12/15/2022
by   Zhehu Yuan, et al.
0

Database research can help machine learning performance in many ways. One way is to design better data structures. This paper combines the use of incremental computation and sequential and probabilistic filtering to enable "forgetful" tree-based learning algorithms to cope with concept drift data (i.e., data whose function from input to classification changes over time). The forgetful algorithms described in this paper achieve high time performance while maintaining high quality predictions on streaming data. Specifically, the algorithms are up to 24 times faster than state-of-the-art incremental algorithms with at most a 2 faster without any loss of accuracy. This makes such structures suitable for high volume streaming applications.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset