Generalized Correntropy for RobustAdaptive Filtering
From MaRDI portal
Publication:4619640
Abstract: As a robust nonlinear similarity measure in kernel space, correntropy has received increasing attention in domains of machine learning and signal processing. In particular, the maximum correntropy criterion (MCC) has recently been successfully applied in robust regression and filtering. The default kernel function in correntropy is the Gaussian kernel, which is, of course, not always the best choice. In this work, we propose a generalized correntropy that adopts the generalized Gaussian density (GGD) function as the kernel (not necessarily a Mercer kernel), and present some important properties. We further propose the generalized maximum correntropy criterion (GMCC), and apply it to adaptive filtering. An adaptive algorithm, called the GMCC algorithm, is derived, and the mean square convergence performance is studied. We show that the proposed algorithm is very stable and can achieve zero probability of divergence (POD). Simulation results confirm the theoretical expectations and demonstrate the desirable performance of the new algorithm.
Cited in
(47)- A family of variable step-size sparsity-aware SSAF algorithms with individual-weighting-factors under model-driven method
- Bias-compensated affine-projection-like algorithm based on maximum correntropy criterion for robust filtering
- A proportionate normalized maximum correntropy criterion algorithm with correntropy induced metric constraint for identifying sparse systems
- Incipient fault prediction based on generalised correntropy filtering for non-Gaussian stochastic systems
- Kernel recursive generalized mixed norm algorithm
- Towards enhancing stacked extreme learning machine with sparse autoencoder by correntropy
- Direct integration bias-compensated maximum correntropy criterion algorithm independent of measurement noise samples
- Maximum correntropy adaptation approach for robust compressive sensing reconstruction
- Spline adaptive filtering algorithm-based generalized maximum correntropy and its application to nonlinear active noise control
- Sparse normalized subband adaptive filter algorithm with \(l_0\)-norm constraint
- Kernel generalized half-quadratic correntropy conjugate gradient algorithm for online prediction of chaotic time series
- Widely linear complex-valued least mean M-estimate algorithms: design and performance analysis
- Communication-reducing algorithm of distributed least mean square algorithm with neighbor-partial diffusion
- Quadratic covariance‐constrained filtering for linear and non‐linear systems with non‐Gaussian noises
- Building up a robust risk mathematical platform to predict colorectal cancer
- A general zero attraction proportionate normalized maximum correntropy criterion algorithm for sparse system identification
- Recursive least mean \(p\)-power extreme learning machine
- Robust non-negative least mean square algorithm based on step-size scaler against impulsive noise
- A robust classification framework with mixture correntropy
- Generalized multikernel correntropy based broad learning system for robust regression
- Performance analysis of robust subband Hammerstein spline adaptive filter
- Correntropy based model predictive controller with multi-constraints for robust path trajectory tracking of self-driving vehicle
- Spectral-spatial destriping of hyperspectral image via correntropy based sparse representation and unidirectional Huber-Markov random fields
- Block-sparsity regularized maximum correntropy criterion for structured-sparse system identification
- Distributed event-triggered adaptive partial diffusion strategy under dynamic network topology
- Generalized maximum correntropy detector for non-Gaussian environments
- Maximum‐correntropy‐based Kalman filtering for time‐varying systems with randomly occurring uncertainties: An event‐triggered approach
- Robust least mean logarithmic square adaptive filtering algorithms
- Maximum Total Complex Correntropy for Adaptive Filter
- Robust adaptive filtering based on M-estimation-based minimum error entropy criterion
- The \(q\)-gradient LMS spline adaptive filtering algorithm and its variable step-size variant
- Least total logistic distance metric algorithm and its variable step-size version
- Generalized variable step-size diffusion continuous mixed \(p\)-norm algorithm
- Robust diffusion Huber-based normalized least mean square algorithm with adjustable thresholds
- Asymmetric complex correntropy for robust adaptive filtering
- A Statistical Learning Approach to Modal Regression
- Adaptively robust filtering with classified adaptive factors
- New insights into learning with correntropy-based regression
- Maximum correntropy Kalman filter
- \(L_1\)-norm constraint kernel adaptive filtering framework for precise and robust indoor localization under the internet of things
- Learning with correntropy-induced losses for regression with mixture of symmetric stable noise
- Recursive least mean dual p-power solution to the generalization of evolving fuzzy system under multiple noises
- Robust noise indicator for distributed in-network system identification with different noise types for each node
- MEEF criterion-based spline adaptive filtering algorithm and its application
- Adaptive multitask clustering algorithm based on distributed diffusion least-mean-square estimation
- Fractional-order modified Blake-Zisserman-based correntropy algorithm in \(\alpha\)-stable environment
- Robust time-varying parameter proportionate affine-projection-like algorithm for sparse system identification
This page was built for publication: Generalized Correntropy for Robust<?Pub _newline ?>Adaptive Filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4619640)
