logo
banner

Journals & Publications

Publications Papers

Papers

Robust C-Loss Kernel Classifiers
Mar 19, 2018Author:
PrintText Size A A

Title: Robust C-Loss Kernel Classifiers

 Authors: Xu, GB; Hu, BG; Principe, JC

 Author Full Names: Xu, Guibiao; Hu, Bao-Gang; Principe, Jose C.

 Source: IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 29 (3):510-522; 10.1109/TNNLS.2016.2637351 MAR 2018

 Language: English

 Abstract: The correntropy-induced loss (C-loss) function has the nice property of being robust to outliers. In this paper, we study the C-loss kernel classifier with the Tikhonov regularization term, which is used to avoid overfitting. After using the half-quadratic optimization algorithm, which converges much faster than the gradient optimization algorithm, we find out that the resulting C-loss kernel classifier is equivalent to an iterative weighted least square support vector machine (LS-SVM). This relationship helps explain the robustness of iterative weighted LS-SVM from the correntropy and density estimation perspectives. On the large-scale data sets which have low-rank Gram matrices, we suggest to use incomplete Cholesky decomposition to speed up the training process. Moreover, we use the representer theorem to improve the sparseness of the resulting C-loss kernel classifier. Experimental results confirm that our methods are more robust to outliers than the existing common classifiers.

 ISSN: 2162-237X

 eISSN: 2162-2388

 IDS Number: FX8LD

 Unique ID: WOS:000426344600001

 PubMed ID: 28055924

*Click Here to View Full Record