Online Chaotic Time Series Prediction Based on Square Root Kalman Filter Extreme Learning Machine

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we proposed a novel neural network prediction model based on extreme learning machine for online chaotic time series prediction problems. The model is characterized by robustness and generalization. The initial weights are initialized by orthogonal matrix to improve the generalization performance and the output weights are updated by square root Kalman filter. The convergence of the algorithm is proved by Lyapunov stability theorem. Simulations based on artificial and real-life data sets demonstrate the effectiveness of the proposed model.

Cite

CITATION STYLE

APA

Feng, S., Xu, M., & Han, M. (2017). Online Chaotic Time Series Prediction Based on Square Root Kalman Filter Extreme Learning Machine. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10637 LNCS, pp. 402–409). Springer Verlag. https://doi.org/10.1007/978-3-319-70093-9_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free