Distributed Adaptive Clustering Based on Maximum Correntropy Criterion Over Dynamic Multi-Task Networks
This paper focuses on the problem of distributed adaptive estimation over dynamic multi-task networks, where a set of nodes is required to collectively estimate some parameters of interest from noisy measurements. Besides, since nodes in the network are constrained by communication power consumption...
Main Authors: | Qing Shi, Fuliang He, Jiagui Wu, Feng Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8959208/ |
Similar Items
-
An adaptive kernel width convex combination method for maximum correntropy criterion
by: Aluisio I. R. Fontes, et al.
Published: (2021-03-01) -
Maximum Correntropy Criterion with Distributed Method
by: Fan Xie, et al.
Published: (2022-01-01) -
Online Gradient Descent for Kernel-Based Maximum Correntropy Criterion
by: Baobin Wang, et al.
Published: (2019-06-01) -
Adaptive Robust Unscented Kalman Filter via Fading Factor and Maximum Correntropy Criterion
by: Zhihong Deng, et al.
Published: (2018-07-01) -
Multi-convex combined filter based on maximum correntropy criterion
by: Wu Wenjing, et al.
Published: (2018-12-01)