Abstract
One of the main challenges in Machine Learning and Data Mining fields is the treatment of large Data Streams in the presence of Concept Drifts. This paper presents two families of ensemble algorithms designed to adapt to abrupt and gradual concept drifts. The families Fast Stacking of Ensembles boosting the Old (FASEO) and Fast Stacking of Ensembles boosting the Best (FASEB) are adaptations of the Fast Adaptive Stacking of Ensembles (FASE) algorithm to improve run-time, without presenting a significant decrease in terms of accuracy when compared to the original FASE. In order to achieve a more efficient model, adjustments were made in the update strategy and voting procedure of the ensemble. To evaluate the methods, Naïve Bayes (NB) and Hoeffding Tree (HT) are used, as learners, to compare the performance of the algorithms on artificial and real-world data-sets. An experimental investigation with a total of 32 experiments and the application of Friedman and Bonferroni-Dunn statistical tests showed the families FASEO and FASEB are more efficient than FASE with respect to execution time in many experiments, also some methods achieving better accuracy results.
Supported by Coord. de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) and Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco - FACEPE (IBPG-0820-1.03/19).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gama, J., Gaber, M.: Learning From Data Streams: Processing Techniques in Sensor Network. Springer, Heidelberg (2007). https://doi.org/10.1007/3-540-73679-4
Aggarwal, C.: Data Classification: Algorithms and Applications (2014)
Frías-Blanco, I.: Nuevos métodos para el aprendizaje en flujos de datos no estacionarios. Granada University (2014)
Ortiz-Diaz, A., et al.: Fast adapting ensemble: a new algorithm for mining data streams with concept drift. Sci. World J. 2015, 1–14 (2015)
Barros, R., Silas, G.: An overview and comprehensive comparison of ensembles for concept drift. Inf. Fusion Number C 52, 213–244 (2019)
Stevenson, A.: Oxford Dictionary of English. Oxford University Press, Oxford (2010)
Frías-Blanco, I., Verdecia-Cabrera, A., Ortiz-Diaz, A., Carvalho, A.: Fast adaptive stacking of ensembles. In: Proceedings of the 31st Annual ACM Symposium on Applied Computing, pp. 929–934. ACM (2016)
Frías-Blanco, I., et al.: Online and non-parametric drift detection methods based on Hoeffding’s bounds. Trans. Knowl. Data Eng. 27(3), 810–823 (2015)
Oza, N., Russell, S.: Online bagging and boosting. Artif. Intell. Stat. 105–112 (2001). https://doi.org/10.1109/ICSMC.2005.1571498
Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13–30 (1968)
Ortiz-Díaz, A.: Algoritmo multiclasificador con aprendizaje incremental al que manipula cambios de conceptos. Universidad de Granada, España (2014)
Mariño, L., Hidalgo, J., Barros, R., Vasconcelos, G.: Improving fast adaptive stacking of ensembles. In: International Joint Conference on Neural Networks (IJCNN), pp. 1–8. IEEE (2019)
Menahem, E., Rokach, L., Elovici, Y.: Combining one-class classifiers via meta learning. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 2435–2440. ACM (2013)
Shen, H., Lin, Y., Tian, Q., Xu, K., Jiao, J.: A comparison of multiple classifier combinations using different voting-weights for remote sensing image classification. Int. J. Rem. Sens. 39(11), 3705–3722 (2018)
Song, G., Ye, Y., Zhang, H., Xu, X., Lau, R., Liu, F.: Dynamic clustering forest: an ensemble framework to efficiently classify textual data stream with concept drift. Inf. Sci. 357, 125–143 (2016)
Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J. Am. Stat. Assoc. 32(200), 675–701 (1937)
Demšar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1–30 (2006). JMLR.org
Dunn, O.: Multiple comparisons among means. J. Am. Stat. Assoc. 56(293), 52–64 (1961)
Dictionary Cambridge: Cambridge advanced learner’s dictionary. PONS-Worterbucher, Klett Ernst Verlag GmbH (2008)
Qun, Z., Xuegang, H., Yuhong, Z., Peipei, L., Xindong, W.: A double-window-based classification algorithm for concept drifting data streams, pp. 639–644. IEEE (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Mariño, L.M.P., Ortiz-Díaz, A.A., Vasconcelos, G.C. (2020). Comparative Study of Fast Stacking Ensembles Families Algorithms. In: Cerri, R., Prati, R.C. (eds) Intelligent Systems. BRACIS 2020. Lecture Notes in Computer Science(), vol 12320. Springer, Cham. https://doi.org/10.1007/978-3-030-61380-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-030-61380-8_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-61379-2
Online ISBN: 978-3-030-61380-8
eBook Packages: Computer ScienceComputer Science (R0)