.png){kind=icon}
返回
The Nystrom minimum kernel risk-sensitive loss algorithm with k-means sampling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2020.07.050.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The minimum kernel risk-sensitive loss (MKRSL) algorithm has been developed to improve the filtering accuracy and robustness of kernel least mean square (KLMS) in non-Gaussian noises. However, the linear growth of network size in MKRSL leads to a huge burden on time consumption and memory requirement. To curb this growth issue, a novel Nystrom minimum kernel risk-sensitive loss with k-means sampling (NysMKRSL-KM) algorithm is proposed by using the Nystrom method combined with k-means sampling to approximate the kernel matrix of MKRSL in this paper. The proposed NysMKRSL-KM algorithm with low time and storage complexity achieves a comparable performance to kernel adaptive filters (KAFs). In addition, the energy conservation relation and the sufficient condition of NysMKRSL-KM are obtained for performing theoretical analysis and guaranteeing the mean square convergence, respectively. The steady-state excess mean square errors (EMSEs) of NysMKRSL-KM for different noises are therefore derived for evaluating accuracy theoretically. Monte Carlo simulations are conducted to validate the theoretical analysis results and superiorities of the proposed NysMKRSL-KM algorithm. (C) 2020 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keyword:
CORRENTROPY
FILTERS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.7
论文数:
6.4K
被引数:
1.5W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容