点击次数：

论文类型：会议论文

发表时间：2017-04-16

收录刊物：EI、CPCI-S

页面范围：38-44

关键字：time series online prediction; kernel recursive least squares; adaptive; coherence

摘要：As a kind of kernel methods, kernel recursive least squares has attracted wide attention in the research of time series online prediction. It has low computational complexity and updates in the shape of recursive increment. However, with the increase of data size, computational complexity of calculating kernel inverse matrix will raise. In addition, in the process of online prediction, it cannot accommodate dynamic environment commendably. It is difficult to meet the demand of prediction accuracy and efficiency simultaneously. Therefore, this paper presents an improved kernel recursive least squares algorithm for multivariate chaotic time series online prediction. We apply dynamic adjustment and coherence criterions to propose adaptive normalized sparse kernel recursive least squares (ANSKRLS) method. In our method, the size of kernel matrix can be reduced, so that computational complexity drops. And ANSKRLS has the ability to operate online and adjust weights adaptively in time-varying environments. The proposed method has been simulated on Lorenz time series and ENSO related indexes time series. Simulation results prove that ANS-KRLS performs well on prediction accuracy and efficiency.