The Nyström minimum kernel risk-sensitive loss algorithm with \(k\)-means sampling

DOI10.1016/j.jfranklin.2020.07.050zbMath1458.94193OpenAlexW3046569565MaRDI QIDQ2005420

Tao Zhang, Shiyuan Wang, Xuewei Huang, Lin Wang

Publication date: 7 October 2020

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2020.07.050

zbMATH Keywords

Nyström method\(k\)-means sampling algorithmNysMKRSL-KM algorithm

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum correntropy unscented Kalman and information filters for non-Gaussian measurement noise
• Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments
• Correntropy: Properties and Applications in Non-Gaussian Signal Processing
• The Kernel Least-Mean-Square Algorithm
• A Reproducing Kernel Hilbert Space Framework for Information-Theoretic Learning
• Online Prediction of Time Series Data With Kernels
• Block-Sparsity-Induced Adaptive Filter for Multi-Clustering System Identification
• Kernel K-Means Sampling for Nyström Approximation
• Kernel Risk-Sensitive Loss: Definition, Properties and Application to Robust Adaptive Filtering
• Information Theoretic Learning
• Mean-Square Performance of a Family of Affine Projection Algorithms
• Online Learning with Kernels
• The Kernel Recursive Least-Squares Algorithm
• Nonlinear system identification in impulsive environments
• Adaptive filters with error nonlinearities: mean-square analysis and optimum design

This page was built for publication: The Nyström minimum kernel risk-sensitive loss algorithm with \(k\)-means sampling