Robust semi-supervised learning algorithm based on maximum correntropy criterion

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This paper analyzes the problem of sensitivity to noise in the mean square criterion of Gaussian- Laplacian regularized (GLR) algorithm. A robust semi-supervised learning algorithm based on maximum correntropy criterion (MCC), called GLR-MCC, is proposed to improve the robustness of GLR along with its convergence analysis. The half quadratic optimization technique is used to simplify the correntropy optimization problem to a standard semi-supervised problem in each iteration. Experimental results on typical machine learning data sets show that the proposed GLR-MCC can effectively improve the robustness of mislabeling noise and occlusion as compared with related semi-supervised learning algorithms. © 2012 ISCAS.

Cite

CITATION STYLE

APA

Yang, N. H., Huang, M. M., He, R., & Wang, X. K. (2012). Robust semi-supervised learning algorithm based on maximum correntropy criterion. Ruan Jian Xue Bao/Journal of Software, 23(2), 279–288. https://doi.org/10.3724/SP.J.1001.2012.03977

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free