.png){kind=icon}
.png){kind=icon}
Return
Recursive Minimum Kernel Mixture Mean p-Power Error Algorithm Based on the Nystrx00F6;m Method
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2020.2964688.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this brief, a novel kernel mixture mean $p$ -power error (KMP) criterion is proposed by combining the mixture of two Gaussian functions into the kernel function of kernel mean $p$ -power error. The mixture correntropy (MC) measure can be viewed as a special case of the KMP with $p = 2$ . And the KMP with an appropriate $p$ can provide better accuracy than MC for robust learning. Some properties of KMP are presented for discussion. The Nystrx00F6;m method is an efficient method for curbing the growth of network size of kernel adaptive filters (KAFs), and the recursive update form can improve the tracking ability of KAFs. To this end, we apply the Nystrx00F6;m method and recursive update form to the KMP criterion, generating a novel recursive minimum kernel mixture mean $p$ -power error algorithm based on the Nystrx00F6;m method (NysRMKMP). Monte Carlo simulations on chaotic time-series prediction illustrate the desirable accuracy and robustness of NysRMKMP.
Keywords:
Kernel
Eigenvalues and eigenfunctions
Cost function
Circuits and systems
Adaptive systems
Gaussian noise
Bandwidth
Kernel adaptive filter
Nystrom method
kernel mixture mean < italic xmlns:ali=http:
www
niso
org
schemas
ali
1
0
xmlns:mml=http:
www
w3
org
1998
Math
MathML xmlns:xlink=http:
www
w3
org
1999
xlink xmlns:xsi=http:
www
w3
org
2001
XMLSchema-instance> p <
italic >-power error
recursive update
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W