.png){kind=icon}
返回
A Generalized t-Distribution-Based Kernel Adaptive Filtering Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2024.3356912.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this brief, utilizing generalized t distribution and maximum correntropy (MC) criterion, a new kernel adaptive filtering algorithm in reproducing kernel Hilbert space (RKHS) is designed for robust learning. As compared to existing methods, our algorithm is better suited to non-Gaussian impulse noise environments due to its ability to depict heavy tail characteristics more accurately. To restrain the scale growth of the neural network and reduce computing cost in the proposed algorithm, we also implement a simple vector quantization algorithm, called Gt-QKRGMC. Finally, superiority of the proposed algorithm is verified by tracking the Mackey-Glass (MG) time series prediction in the context of non-Gaussian noise interference.
Keyword:
Kernel
Probability density function
Gaussian distribution
Adaptive filters
Vector quantization
Shape
Heavily-tailed distribution
Generalized t distribution
non-Gaussian noise
vector quantization
kernel adaptive filtering
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
Application of multinuclear magnetic resonance spectroscopy to solvation and aggregation phenomena in solution. Plenary lecture.png)
The Analyst
The AnalystIF0
PREAI
分享收藏
查看更多内容