.png){kind=icon}
Return
Correntropy-Based Data Selective Adaptive Filtering
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSI.2023.3339632.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Data selection can be used in conjunction with adaptive filtering algorithms to avoid unnecessary weight updating and thereby reduce computational overhead. This paper presents a novel correntropy-based data selection method as an alternative to conventional data selection mechanisms based on squared error values. We developed a variable correntropy sensing algorithm to maximize the instantaneous correntropy function for the Gaussian kernel function to mitigate the impact of impulse noise and other forms of noise that can be disregarded in data selection. The proposed data selection mechanism can be implemented with any adaptive filtering algorithm. In simulations, the proposed method (implemented with the least mean squared algorithm) outperformed comparable error-based data selection schemes in terms of hit rate and miss rate, and the resulting weight updating ratio was close to the expected weight updating ratio.
Keywords:
Filtering
least mean square (LMS)
maximum correntropy criterion (MCC)
process innovation
resource efficiency
Data selection
Journal
IF:
5.2
Papers:
9.8K
Citations:
2.2W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveSIGNAL-PROCESSING WITH FRACTIONAL LOWER ORDER MOMENTS - STABLE PROCESSES AND THEIR APPLICATIONS.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
ShareSave
View more