Robust Principal Component Analysis Based on Maximum Correntropy Criterion
From MaRDI portal
Cited in
(26)- Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments
- A new robust fixed-point algorithm and its convergence analysis
- Robust fitting of ellipsoids by separating interior and exterior points during optimization
- Euler principal component analysis
- Traditional and recent approaches in background modeling for foreground detection: an overview
- Autoencoders reloaded
- Testing for principal component directions under weak identifiability
- Principal component analysis based on nuclear norm minimization
- A robust classification framework with mixture correntropy
- Learning with correntropy-induced losses for regression with mixture of symmetric stable noise
- Comparison of the convergence rates of the new correntropy-based Levenberg-Marquardt (CLM) method and the fixed-point maximum correntropy (FP-MCC) algorithm
- Principal component analysis with drop rank covariance matrix
- scientific article; zbMATH DE number 5957211 (Why is no real title available?)
- Discriminant sparse neighborhood preserving embedding for face recognition
- A Statistical Learning Approach to Modal Regression
- Hierarchical dynamical model for multiple cortical neural decoding
- Cauchy kernel-based maximum correntropy Kalman filter
- Maximum correntropy Kalman filter
- Maximum correntropy unscented filter
- Avoiding optimal mean \(\ell_{2,1}\)-norm maximization-based robust PCA for reconstruction
- Optimal learning with Gaussians and correntropy loss
- Maximum correntropy criterion regression models with tending-to-zero scale parameters
- Robust fixed-point Kalman smoother for bilinear state-space systems with non-Gaussian noise and parametric uncertainties
- A state-of-the-art survey on noise removal in a non-stationary signal using adaptive finite impulse response filtering: challenges, techniques, and applications
- Rank tests for PCA under weak identifiability
- Robust sparse penalization under heavy-tailed noise and outliers with exponential-type loss via the LASSO
This page was built for publication: Robust Principal Component Analysis Based on Maximum Correntropy Criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370081)
