Abstract

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.

Highlights

  • We introduce weights for the ensemble members w1;...;B 2 1⁄20; 1Š, which are correlated with their predictive performance in terms of the mean absolute errors (MAEs) calculated through (11) and which denote the importance of the members in the prediction scheme

  • We report the computation times needed to update the whole model on single samples for each data stream, to check with which sample frequency OB-Evolving fuzzy systems (EFS) can cope and whether the real-time demands from the applications can be met

  • We demonstrated a new variant of online ensembles of EFS models, termed online bagged EFS (OB-EFS), by employing an online variant of bagged sampling in order to improve the significance and robustness of single EFS models, especially in the case of higher noise levels and/or a low number of samples, as discussed in Section 2 for the offline case

Read more

Summary

Introduction

User behavior identification, to name a few (see [21] for a longer list) This is because they possess the ability i) to adapt quickly to regular system fluctuations and to new operating conditions by expanding their knowledge on the fly, and ii) to properly react to drifts in the system (inducing changing data distributions and/or input–output relations [18] which typically arise in non-stationary environments [33] and/or dynamic and adaptive control operations [26]) by integrating forgetting and out-weighing mechanisms. This is typically achieved in a fully autonomous manner [2,1] by incremental single-pass updates with stream samples, without the necessity of intervention by human operators or experts (as is often needed in the case of classically designed fuzzy systems [37])

Objectives
Methods
Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.