Adaptive Deep Forest for Online Learning from Drifting Data Streams. Korycki, Ł. & Krawczyk, B. arXiv:2010.07340 [cs], October, 2020. arXiv: 2010.07340![Adaptive Deep Forest for Online Learning from Drifting Data Streams [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex Learning from data streams is among the most vital fields of contemporary data mining. The online analysis of information coming from those potentially unbounded data sources allows for designing reactive up-to-date models capable of adjusting themselves to continuous flows of data. While a plethora of shallow methods have been proposed for simpler low-dimensional streaming problems, almost none of them addressed the issue of learning from complex contextual data, such as images or texts. The former is represented mainly by adaptive decision trees that have been proven to be very efficient in streaming scenarios. The latter has been predominantly addressed by offline deep learning. In this work, we attempt to bridge the gap between these two worlds and propose Adaptive Deep Forest (ADF) - a natural combination of the successful tree-based streaming classifiers with deep forest, which represents an interesting alternative idea for learning from contextual data. The conducted experiments show that the deep forest approach can be effectively transformed into an online algorithm, forming a model that outperforms all state-of-the-art shallow adaptive classifiers, especially for high-dimensional complex streams.
@article{korycki_adaptive_2020,
title = {Adaptive {Deep} {Forest} for {Online} {Learning} from {Drifting} {Data} {Streams}},
url = {http://arxiv.org/abs/2010.07340},
abstract = {Learning from data streams is among the most vital fields of contemporary data mining. The online analysis of information coming from those potentially unbounded data sources allows for designing reactive up-to-date models capable of adjusting themselves to continuous flows of data. While a plethora of shallow methods have been proposed for simpler low-dimensional streaming problems, almost none of them addressed the issue of learning from complex contextual data, such as images or texts. The former is represented mainly by adaptive decision trees that have been proven to be very efficient in streaming scenarios. The latter has been predominantly addressed by offline deep learning. In this work, we attempt to bridge the gap between these two worlds and propose Adaptive Deep Forest (ADF) - a natural combination of the successful tree-based streaming classifiers with deep forest, which represents an interesting alternative idea for learning from contextual data. The conducted experiments show that the deep forest approach can be effectively transformed into an online algorithm, forming a model that outperforms all state-of-the-art shallow adaptive classifiers, especially for high-dimensional complex streams.},
urldate = {2020-12-12},
journal = {arXiv:2010.07340 [cs]},
author = {Korycki, Łukasz and Krawczyk, Bartosz},
month = oct,
year = {2020},
note = {arXiv: 2010.07340},
keywords = {Computer Science - Machine Learning, I.2.0, I.5.0},
}
Downloads: 0
{"_id":"hSwBQtZ8MDbrjN7Qv","bibbaseid":"korycki-krawczyk-adaptivedeepforestforonlinelearningfromdriftingdatastreams-2020","author_short":["Korycki, Ł.","Krawczyk, B."],"bibdata":{"bibtype":"article","type":"article","title":"Adaptive Deep Forest for Online Learning from Drifting Data Streams","url":"http://arxiv.org/abs/2010.07340","abstract":"Learning from data streams is among the most vital fields of contemporary data mining. The online analysis of information coming from those potentially unbounded data sources allows for designing reactive up-to-date models capable of adjusting themselves to continuous flows of data. While a plethora of shallow methods have been proposed for simpler low-dimensional streaming problems, almost none of them addressed the issue of learning from complex contextual data, such as images or texts. The former is represented mainly by adaptive decision trees that have been proven to be very efficient in streaming scenarios. The latter has been predominantly addressed by offline deep learning. In this work, we attempt to bridge the gap between these two worlds and propose Adaptive Deep Forest (ADF) - a natural combination of the successful tree-based streaming classifiers with deep forest, which represents an interesting alternative idea for learning from contextual data. The conducted experiments show that the deep forest approach can be effectively transformed into an online algorithm, forming a model that outperforms all state-of-the-art shallow adaptive classifiers, especially for high-dimensional complex streams.","urldate":"2020-12-12","journal":"arXiv:2010.07340 [cs]","author":[{"propositions":[],"lastnames":["Korycki"],"firstnames":["Łukasz"],"suffixes":[]},{"propositions":[],"lastnames":["Krawczyk"],"firstnames":["Bartosz"],"suffixes":[]}],"month":"October","year":"2020","note":"arXiv: 2010.07340","keywords":"Computer Science - Machine Learning, I.2.0, I.5.0","bibtex":"@article{korycki_adaptive_2020,\n\ttitle = {Adaptive {Deep} {Forest} for {Online} {Learning} from {Drifting} {Data} {Streams}},\n\turl = {http://arxiv.org/abs/2010.07340},\n\tabstract = {Learning from data streams is among the most vital fields of contemporary data mining. The online analysis of information coming from those potentially unbounded data sources allows for designing reactive up-to-date models capable of adjusting themselves to continuous flows of data. While a plethora of shallow methods have been proposed for simpler low-dimensional streaming problems, almost none of them addressed the issue of learning from complex contextual data, such as images or texts. The former is represented mainly by adaptive decision trees that have been proven to be very efficient in streaming scenarios. The latter has been predominantly addressed by offline deep learning. In this work, we attempt to bridge the gap between these two worlds and propose Adaptive Deep Forest (ADF) - a natural combination of the successful tree-based streaming classifiers with deep forest, which represents an interesting alternative idea for learning from contextual data. The conducted experiments show that the deep forest approach can be effectively transformed into an online algorithm, forming a model that outperforms all state-of-the-art shallow adaptive classifiers, especially for high-dimensional complex streams.},\n\turldate = {2020-12-12},\n\tjournal = {arXiv:2010.07340 [cs]},\n\tauthor = {Korycki, Łukasz and Krawczyk, Bartosz},\n\tmonth = oct,\n\tyear = {2020},\n\tnote = {arXiv: 2010.07340},\n\tkeywords = {Computer Science - Machine Learning, I.2.0, I.5.0},\n}\n\n\n\n","author_short":["Korycki, Ł.","Krawczyk, B."],"key":"korycki_adaptive_2020","id":"korycki_adaptive_2020","bibbaseid":"korycki-krawczyk-adaptivedeepforestforonlinelearningfromdriftingdatastreams-2020","role":"author","urls":{"Paper":"http://arxiv.org/abs/2010.07340"},"keyword":["Computer Science - Machine Learning","I.2.0","I.5.0"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["yanwtMpCcFaHzRwWb","iwKepCrWBps7ojhDx"],"keywords":["computer science - machine learning","i.2.0","i.5.0"],"search_terms":["adaptive","deep","forest","online","learning","drifting","data","streams","korycki","krawczyk"],"title":"Adaptive Deep Forest for Online Learning from Drifting Data Streams","year":2020}