Abstract

Predicting future behavior of chaotic time series and systems is a challenging area in the literature of nonlinear systems. The prediction accuracy of chaotic time series is extremely dependent on the model and the learning algorithm. In addition, the generalization property of the proposed models trained by limited observations is of great importance. In the past two decades, singular or descriptor systems and related fuzzy descriptor models have been the subjects of interest due to their many practical applications in modeling complex phenomena. In this study fuzzy descriptor models, as a more recent neurofuzzy realization of locally linear descriptor systems, which have led to the introduction of intuitive incremental learning algorithm that is called Generalized Locally Linear Model Tree algorithm, are implemented in their optimal structure to be compared with several other methods. A simple but efficient technique, based on the error indices of multiple validation sets, is used to optimize the number of neurons as well as to prevent over fitting in the incremental learning algorithms. The aim of the paper is to demonstrate the advantages of fuzzy descriptor models and to make a fair comparison between the most successful neural and neurofuzzy approaches in their best structures according to prediction accuracy, generalization, and computational complexity. The Mackey–Glass time series, Lorenz time series (as two well-known classic benchmarks), Darwin sea level pressure time series and long-term prediction of Disturbance Storm Time index, an important index of geomagnetic activity (as two natural chaotic dynamics) are used as practical examples to evaluate the power of the proposed method in long term prediction of chaotic dynamics.

Full Text
Paper version not known

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.