{'fraction_non_alphanumeric': 0.018161180476730987, 'fraction_numerical': 0.0, 'mean_word_length': 5.345323741007194, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Adaptive Filtering Under the Maximum Correntropy Criterion With Variable Center

Recently, an extended version of correntropy, whose center can locate at any position has been proposed and applied in a new optimization criterion called maximum correntropy criterion with variable center (MCC-VC). In order to optimize the performance of adaptive filtering in non-Gaussian and non-zero mean noise environments, in this paper, we propose a stochastic gradient adaptive filtering algorithm for online learning based on MCC-VC and analyze its stability and convergence performance. Moreover, we also extend an online learning approach to estimate the kernel width and the center location, in which two parameters have a great influence on the accuracy of the algorithm. The simulation results of the online learning model have verified the superiority and robustness of the new method.