Using a Genetic Algorithm to optimize a stacking ensemble in data streaming scenarios

Article type: Research Article

Authors: Ramos, Diogo^a | Carneiro, Davide^{a; b; *} | Novais, Paulo^b

Affiliations: [a] CIICESI, Escola Superior de Tecnologia e Gestão, Instituto Politécnico do Porto, Portugal. E-mails: 8150101@estg.ipp.pt, dcarneiro@estg.ipp.pt | [b] Algoritmi Centre/Departamento de Informática, Universidade do Minho, Portugal. E-mail: pjon@di.uminho.pt

Correspondence: [*] Corresponding author. E-mail: dcarneiro@estg.ipp.pt.

Abstract: The requirements of Machine Learning applications are changing rapidly. Machine Learning models need to deal with increasing volumes of data, and need to do so quicker as responses are expected more than ever in real-time. Plus, sources of data are becoming more and more dynamic, with patterns that change more frequently. This calls for new approaches and algorithms, that are able to efficiently deal with these challenges. In this paper we propose the use of a Genetic Algorithm to Optimize a Stacking Ensemble specifically developed for streaming scenarios. A pool of solutions is maintained in which each solution represents a distribution of weights in the ensemble. The Genetic Algorithm continuously optimizes these weights to minimize the cost function. Moreover, new models are added at regular intervals, trained on more recent data. These models eventually replace older and less accurate ones, making the ensemble adapt continuously do changes in the distribution of the data.

Keywords: Genetic algorithms, random forest, stacking ensemble, optimization

DOI: 10.3233/AIC-200648

Journal: AI Communications, vol. 33, no. 1, pp. 27-40, 2020