.png){kind=icon}
返回
Online learning with kernel regularized least mean square algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2014.02.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a novel type of kernel least mean square algorithm with regularized structural risk for online learning. In order to curb the continuous growing of kernel functions, a new dictionary selection method based on the cumulative coherence measure is applied to perform the sparsification procedure, which can obtain a dictionary with diagonally dominant Gram matrix under certain conditions. On the updating of the kernel weight, the linear least mean square algorithm is generalized into the reproducing kernel Hilbert space (RKHS) with minimized updating structural risk and it results in a kernel regularized least mean square (KRLMS) algorithm. A simplified version of the KRLMS algorithm is also presented by applying only partial updating information to train the algorithm at each iteration, which reduces the computational complexity. Theoretical analysis of their convergence issues is examined and variable learning rates are adopted in the training process which can guarantee the weight convergence of the algorithm in terms of a bounded measurement error. Several experiments are carried out to prove the effectiveness of the proposed algorithm for online learning compared to some existing kernel algorithms. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Kernel method
Dictionary
Cumulative coherence
Diagonally dominant
Weight convergence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
分享收藏
Quaternion-valued short-term joint forecasting of three-dimensional wind and atmospheric parameters.png)
RENEWABLE ENERGY
RENEWABLE ENERGYIF9.1
PREAI
分享收藏
查看更多内容