Online bagging of evolving fuzzy systems

被引:23
作者
Lughofer, Edwin [1 ]
Pratama, Mahardhika [2 ]
Skrjanc, Igor [3 ]
机构
[1] Johannes Kepler Univ Linz, Dept Knowledge Based Math Syst, Linz, Austria
[2] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore, Singapore
[3] Univ Ljubljana, Lab Control Syst & Cybernet, Ljubljana, Slovenia
关键词
Evolving fuzzy systems (EFS); Data streams; Online bagging of EFS; Drift handling; Autonomous soft pruning and recall of ensemble members; Autonomous evolution of ensemble members; IDENTIFICATION; REGRESSION; ENSEMBLE; QUALITY;
D O I
10.1016/j.ins.2021.04.041
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Evolving fuzzy systems (EFS) have received increased attention from the community for the purpose of data stream modeling in an incremental, single-pass and transparent manner. To date, a wide variety of EFS approaches have been developed and successfully used in real-world applications which address structural evolution and parameter adaptation in single EFS models. We propose a specific ensemble scheme of EFS to increase their robustness in predictive performance on new stream samples. Our approach relies on an online variant of bagging in which various EFS ensemble members are generated from online bags, that is, the members are updated based on a specific probabilistic online sampling technique, and this with guaranteed convergence to classical sampling in batch bagging. The autonomous pruning of ensemble members is undertaken to omit undesired members with atypically higher errors than other members. We propose two variants, hard pruning where undesired members are deleted forever from the ensemble, and soft pruning where members receive weights to calculate the overall ensemble prediction, according to their single performance; thus, members who are undesired at a certain point of time may be dynamically recalled at a later stage. The autonomous evolution of new ensemble members is carried out whenever a drift in the stream is detected, based on a significantly worsening performance indicator, measured in terms of the Hoeffding inequality. Newer members typically represent the drifted state better and are thus up-weighed compared to older members within an advanced (weighted) calculation of the overall ensemble prediction. The new approach termed online bagged EFS (OB-EFS) was successfully evaluated and compared with single EFS models and related SoA approaches on four data streams from real world applications (containing various noise levels, drifts and new operating conditions) and showed significantly lower prediction error trend lines. (c) 2021 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页码:16 / 33
页数:18
相关论文
共 41 条
[1]  
Angelov P., 2012, AUTONOMOUS LEARNING
[2]  
Angelov P, 2011, SPEC INT C COMPL SYS, P249
[3]  
[Anonymous], 2012, CHAPMAN HALL CRC DAT
[4]  
[Anonymous], 2012, Learning in Non-Stationary Environments: Methods and Applications
[5]  
Bifet A., 2011, Data stream mining: a practical approach
[6]  
Bifet A, 2010, J MACH LEARN RES, V11, P1601
[7]  
Brazdil P., 2009, Cognitive Technologies
[8]   Bagging predictors [J].
Breiman, L .
MACHINE LEARNING, 1996, 24 (02) :123-140
[9]   Logistic regression, AdaBoost and Bregman distances [J].
Collins, M ;
Schapire, RE ;
Singer, Y .
MACHINE LEARNING, 2002, 48 (1-3) :253-285
[10]   Probability generating functions for discrete real-valued random variables [J].
Esquivel, M. L. .
THEORY OF PROBABILITY AND ITS APPLICATIONS, 2008, 52 (01) :40-57