资源论文Kernel-Based Selective Ensemble Learning for Streams of Trees

Kernel-Based Selective Ensemble Learning for Streams of Trees

2019-11-12 | |  73 |   37 |   0
Abstract Learning from streaming data represents an important and challenging task. Maintaining an accurate model, while the stream goes by, requires a smart way for tracking data changes through time, originating concept drift. One way to treat this kind of problem is to resort to ensemble-based techniques. In this context, the advent of new technologies related to web and ubiquitous services call for the need of new learning approaches able to deal with structured-complex information, such as trees. Kernel methods enable the modeling of structured data in learning algorithms, however they are computationally demanding. The contribute of this work is to show how an effective ensemble-based approach can be deviced for streams of trees by optimizing the kernel-based model representation. Both ef?cacy and ef?ciency of the proposed approach are assessed for different models by using data sets exhibiting different levels and types of concept drift.

上一篇:A Fast Dual Projected Newton Method for 1 -Regularized Least Squares

下一篇:On Trivial Solution and Scale Transfer Problems in Graph Regularized NMF

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...