Name
Abstract | ||
|---|---|---|
Methods that address the task of multi-target regression on data streams are relatively weakly represented in the current literature. We present several different approaches to learning trees and ensembles of trees for multi-target regression based on the Hoeffding bound. First, we introduce a local method, which learns multiple single-target trees to produce multiple predictions, which are then aggregated into a multi-target prediction. We follow with a tree-based method (iSOUP-Tree) which learns trees that predict all of the targets at once. We then introduce iSOUP-OptionTree, which extends iSOUP-Tree through the use of option nodes. We continue with ensemble methods, and describe the use of iSOUP-Tree as a base learner in the online bagging and online random forest ensemble approaches. We describe an evaluation scenario, and present and discuss the results of the described methods, most notably in terms of predictive performance and the use of computational resources. Finally, we present two case studies where we evaluate the introduced methods in terms of their efficiency and viability of application to real world domains. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10844-017-0462-7 | J. Intell. Inf. Syst. |
Keywords | Field | DocType |
Tree-based methods,Multi-target regression,Data streams | Local method,Hoeffding's inequality,Data mining,Data stream mining,Regression,Computer science,Artificial intelligence,Random forest,Ensemble learning,Machine learning | Journal |
Volume | Issue | ISSN |
50 | 2 | 0925-9902 |
Citations | PageRank | References |
0 | 0.34 | 22 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aljaz Osojnik | 1 | 13 | 3.22 |
| Pance Panov | 2 | 38 | 7.90 |
| Sašo Džeroski | 3 | 1096 | 90.96 |