.png){kind=icon}
返回
A sparse kernel algorithm for online time series data prediction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2012.10.046.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Kernel based methods have been widely applied for signal analysis and processing. In this paper, we propose a sparse kernel based algorithm for online time series prediction. In classical kernel methods, the kernel function number is very large which makes them of a high computational cost and only applicable for off-line or batch learning. In online learning settings, the learning system is updated when each training sample is obtained and it requires a higher computational speed. To make the kernel methods suitable for online learning, we propose a sparsification method based on the Hessian matrix of the system loss function to continuously examine the significance of the new training sample in order to select a sparse dictionary (support vector set). The Hessian matrix is equivalent to the correlation matrix of sample inputs in the kernel weight updating using the recursive least square (RLS) algorithm. This makes the algorithm able to be easily implemented with an affordable computational cost for real-time applications. Experimental results show the ability of the proposed algorithm for both real-world and artificial time series data forecasting and prediction. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Kernel methods
Recursive least square (RLS)
Sparsification
Online learning
Time series
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
A TUTORIAL ON HIDDEN MARKOV-MODELS AND SELECTED APPLICATIONS IN SPEECH RECOGNITION关于语音识别中的隐马尔可夫模型和选定应用的教程.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏
Integration of genetic fuzzy systems and artificial neural networks for stock price forecasting集成遗传模糊系统和人工神经网络的股票价格预测
PREAI
分享收藏
查看更多内容