.png){kind=icon}
返回
A Polarized Random Fourier Feature Kernel Least-Mean-Square Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2909304.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a polarized random Fourier feature kernel least-mean-square algorithm that aims to overcome the dimension curve of the random Fourier feature kernel least-mean-square (RFFKLMS) algorithm. RFFKLMS is an effective nonlinear adaptive filtering algorithm based on the kernel approximation technique. However, random samples drawn from the distribution need more dimensions to achieve better-generalized performance because they are independent of the training data. To overcome this weakness, a kernel polarization method is adopted to optimize the random samples. Polarized random Fourier features demonstrate a clear advantage over a method without using the polarization method. The experimental results in the context of Lorenz time series prediction and channel equalization verify the effectiveness of the proposed method.
Keyword:
Kernel adaptive filtering
kernel polarization method
polarized random Fourier features
random Fourier features
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
查看更多内容