4.6 Article

Multivariate Chaotic Time Series Online Prediction Based on Improved Kernel Recursive Least Squares Algorithm

Journal

IEEE TRANSACTIONS ON CYBERNETICS
Volume 49, Issue 4, Pages 1160-1172

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2018.2789686

Keywords

Adaptive; kernel recursive least squares (KRLS); online time series prediction; sparse

Funding

  1. National Natural Science Foundation of China [61773087, 61374154, 61672131]
  2. Fundamental Research Funds for the Central Universities [DUT17ZD216, DUT16QY27, DUT16RC(3)123]

Ask authors/readers for more resources

Kernel recursive least squares (KRLS) is a kind of kernel methods, which has attracted wide attention in the research of time series online prediction. It has low computational complexity and updates in a recursive form. However, as data size increases, computational complexity of calculating kernel inverse matrix will raise. And it has some difficulties in accommodating time-varying environments. Therefore, we have presented an improved KRLS algorithm for multivariate chaotic time series online prediction. Approximate linear dependency, dynamic adjustment, and coherence criterion are combined with quantization to form our improved KRLS algorithm. In the process of online prediction, it can bring computational efficiency up and adjust weights adaptively in time-varying environments. Moreover, Lorenz chaotic time series, El Nino-Southern Oscillation indexes chaotic time series, yearly sunspots and runoff of the Yellow River chaotic time series online prediction are presented to prove the effectiveness of our proposed algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available