Diffusion Generalized Kernel Maximum Correntropy Criterion Algorithm With Variable Center: Establishment and Performance Analysis

The existing adaptive filtering algorithms in distributed networks do not take into account the case of non-zero mean non-Gaussian noise. In response to this issue, a robust diffusion kernel adaptive filtering algorithm, which is called the diffusion generalized kernel maximum correntropy criterion with variable center (DGKMCC-VC) algorithm, is proposed. The algorithm aims to address a noisy environment with non-zero mean by dynamically adjusting the center of the kernel function in the generalized correntropy. An online vector quantization method is also introduced, which can be used to reduce the complexity of the algorithm. In addition, the convergence condition and steady-state performance of the algorithm are analyzed. Finally, simulation results verify the robustness and superiority of the algorithm in dealing with non-Gaussian noise environments with non-zero mean in distributed models.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Signal and Information Processing over Networks
Published
2025-01-01
DOI
https://doi.org/10.1109/tsipn.2025.3589686
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Diffusion Generalized Kernel Maximum Correntropy Criterion Algorithm With Variable Center: Establishment and Performance Analysis

Haiquan Zhao, Xinyan Hou, Hao Li
2 links
IEEE Transactions on Signal and Information Processing over Networks
Advanced Algorithms and Applications
article

Diffusion Generalized Kernel Maximum Correntropy Criterion Algorithm With Variable Center: Establishment and Performance Analysis

Haiquan Zhao, Xinyan Hou, Hao Li
article en

Abstract

The existing adaptive filtering algorithms in distributed networks do not take into account the case of non-zero mean non-Gaussian noise. In response to this issue, a robust diffusion kernel adaptive filtering algorithm, which is called the diffusion generalized kernel maximum correntropy criterion with variable center (DGKMCC-VC) algorithm, is proposed. The algorithm aims to address a noisy environment with non-zero mean by dynamically adjusting the center of the kernel function in the generalized correntropy. An online vector quantization method is also introduced, which can be used to reduce the complexity of the algorithm. In addition, the convergence condition and steady-state performance of the algorithm are analyzed. Finally, simulation results verify the robustness and superiority of the algorithm in dealing with non-Gaussian noise environments with non-zero mean in distributed models.

IEEE Transactions on Signal and Information Processing over NetworksVol. 11
Southwest Jiaotong University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 76%
Advanced Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Diffusion Generalized Kernel Maximum Correntropy Criterion Algorithm With Variable Center: Establishment and Performance Analysis — Haiquan Zhao, Xinyan Hou, et al. · IEEE Transactions on Signal and Information Processing over Networks (2025) | TGRS Research Map | TGRS