|Robust Semi-supervised Learning Algorithm based on Maximum Correntropy Criterion|
|Nanhai Yang; Mingming Huang; Ran He(赫然); Xiukun Wang
|Source Publication||Chinese Journal of Software
|Abstract||his 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.|
Half Quadratic Optimization
Nanhai Yang,Mingming Huang,Ran He,et al. Robust Semi-supervised Learning Algorithm based on Maximum Correntropy Criterion[J]. Chinese Journal of Software,2012,23(2):279-288.
Nanhai Yang,Mingming Huang,Ran He,&Xiukun Wang.(2012).Robust Semi-supervised Learning Algorithm based on Maximum Correntropy Criterion.Chinese Journal of Software,23(2),279-288.
Nanhai Yang,et al."Robust Semi-supervised Learning Algorithm based on Maximum Correntropy Criterion".Chinese Journal of Software 23.2(2012):279-288.
|Files in This Item:||
||There are no files associated with this item.
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.