Abstract
The multikernel adaptive filters (MKAFs) have been successfully applied to resolve the issue of kernel parameter selection in traditional single kernel adaptive filters. However, owing to the linear growing network structures, conventional MKAFs commonly suffer a lot from large computational and memory burdens. To solve this problem, a multiple Nyström approximation is proposed to curb the computational complexity of MKAFs in this brief. More concretely, the multiple Nyström method is incorporated into the kernel generalized Cauchy conjugate gradient algorithm, generating a novel multiple Nyström kernel generalized Cauchy conjugate gradient algorithm (MNKGCCG). It is noted that the MNKGCCG can achieve the desirable filtering performance with low computational cost in the fixed-dimensional feature space. Experimental results on Mackey-Glass time series and sunspots time series predictions in non-Gaussian noise environments demonstrate the superiorities of the proposed MNKGCCG algorithm in terms of filtering accuracy and robustness.
Funding Information
  • National Natural Science Foundation of China (Grant 61601096, Grant 61701095, Grant 61801089, Grant 61971111, Grant 62027803)
  • Industrial Technology Development Program (Grant 2020110C041)
  • Sichuan Science and Technology Program (Grant 2021YFG0200)
  • Science and Technology Program (Grant 8091C24, Grant 2021JCJQJJ0949, Grant 2022JCJQJJ0784)

This publication has 26 references indexed in Scilit: