.png){kind=icon}
返回
Mixture quantized error entropy for recursive least squares adaptive filtering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2021.12.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Error entropy is a well-known learning criterion in information theoretic learning (ITL), and it has been successfully applied in robust signal processing and machine learning. To date, many robust learning algorithms have been devised based on the minimum error entropy (MEE) criterion, and the Gaussian kernel function is always utilized as the default kernel function in these algorithms, which is not always the best option. To further improve learning performance, two concepts using a mixture of two Gaussian functions as kernel functions, called mixture error entropy and mixture quantized error entropy, are proposed in this paper. We further propose two new recursive least-squares algorithms based on mixture minimum error entropy (MMEE) and mixture quantized minimum error entropy (MQMEE) optimization criteria. The convergence analysis, steady-state mean-square performance, and computational complexity of the two proposed algorithms are investigated. In addition, the reason why the mixture mechanism (mixture correntropy and mixture error entropy) can improve the performance of adaptive filtering algorithms is explained. Simulation results show that the proposed new recursive least-squares algorithms outperform other RLS-type algorithms, and the practicality of the proposed algorithms is verified by the electro-encephalography application. (C) 2021 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keyword:
UNSCENTED KALMAN
CORRENTROPY
ALGORITHM
CRITERION
期刊
J
IF:
3.7
论文数:
6.4K
被引数:
1.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容