Please use this identifier to cite or link to this item:
Type: Artigo
Title: An iterative boosting-based ensemble for streaming data classification
Author: Bertini Junior, Joao Roberto
Nicoletti, Maria do Carmo
Abstract: Among the many issues related to data stream applications, those involved in predictive tasks such as classification and regression, play a significant role in Machine Learning (ML). The so-called ensemble-based approaches have characteristics that can be appealing to data stream applications, such as easy updating and high flexibility. In spite of that, some of the current approaches consider unsuitable ways of updating the ensemble along with the continuous stream processing, such as growing it indefinitely or deleting all its base learners when trying to overcome a concept drift. Such inadequate actions interfere with two inherent characteristics of data streams namely, its possible infinite length and its need for prompt responses. In this paper, a new ensemblebased algorithm, suitable for classification tasks, is proposed. It relies on applying boosting to new batches of data aiming at maintaining the ensemble by adding a certain number of base learners, which is established as a function of the current ensemble accuracy rate. The updating mechanism enhances the model flexibility, allowing the ensemble to gather knowledge fast to quickly overcome high error rates, due to concept drift, while maintaining satisfactory results by slowing down the updating rate in stable concepts. Results comparing the proposed ensemble-based algorithm against eight other ensembles found in the literature show that the proposed algorithm is very competitive when dealing with data stream classification
Subject: Fluxo de dados (Computadores)
Country: Holanda
Editor: Elsevier
Rights: Fechado
Identifier DOI: 10.1016/j.inffus.2018.01.003
Date Issue: 2019
Appears in Collections:FT - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
000447084900006.pdf1.6 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.