.png){kind=icon}
返回
Quantized kernel Lleast lncosh algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2021.108255.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces the kernel least lncosh (KLL) algorithm, in which the lncosh (logarithm of hyperbolic cosine) cost function is successfully applied in the reproducing-kernel-Hilbert space. The online vector quantization (VQ) is then used to quantize the input space to construct the algorithm which can curb the growth of network size. As a result, the quantized kernel least lncosh (QKLL) algorithm is developed, which is robust in non-Gaussian environments. The sufficient condition for mean-square convergence of the QKLL algorithm has been conducted. The performance of the KLL and QKLL algorithms is demonstrated by the short-term chaotic time-series prediction and non-linear channel-equalization (NCE). (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Kernel least lncosh
Reproducing-kernel-Hilbert space
Vector quantization
Quantized kernel least lncosh
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
查看更多内容