Return
Mixture correntropy for robust learning
DOI:10.1016/j.patcog.2018.02.010.png)
Abstract
En 中文
Correntropy is a local similarity measure defined in kernel space, hence can combat large outliers in robust signal processing and machine learning. So far, many robust learning algorithms have been developed under the maximum correntropy criterion (MCC), among which, a Gaussian kernel is generally used in correntropy. To further improve the learning performance, in this paper we propose the concept of mixture correntropy, which uses the mixture of two Gaussian functions as the kernel function. Some important properties of the mixture correntropy are presented. Applications of the maximum mixture correntropy criterion (MMCC) to extreme learning machine (ELM) and kernel adaptive filtering (KAF) for function approximation and data regression are also studied. Experimental results show that the learning algorithms under MMCC can perform very well and achieve better performance than the conventional MCC based algorithms as well as several other state-of-the-art algorithms. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Correntropy
Mixture correntropy
Robust learning
Extreme learning machine
Kernel adaptive filtering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
Productivity enhancement of solar still by PCM and Nanoparticles miscellaneous basin absorbing materials
Desalination
IF0

