.png){kind=icon}
.png){kind=icon}
Return
Noise-robust semi-supervised learning via fast sparse coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2014.08.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a novel noise-robust graph-based semi-supervised learning algorithm to deal with the challenging problem of semi-supervised learning with noisy initial labels. Inspired by the successful use of sparse coding for noise reduction, we choose to give new L-1-norm formulation of Laplacian regularization for graph-based semi-supervised learning. Since our L-1-norm Laplacian regularization is explicitly defined over the eigenvectors of the normalized Laplacian matrix, we formulate graph-based semi-supervised learning as an L-1-norm linear reconstruction problem which can be efficiently solved by sparse coding. Furthermore, by working with only a small subset of eigenvectors, we develop a fast sparse coding algorithm for our L-1-norm semi-supervised learning. Finally, we evaluate the proposed algorithm in noise-robust image classification. The experimental results on several benchmark datasets demonstrate the promising performance of the proposed algorithm. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Graph-based semi-supervised learning
Noise reduction
Laplacian regularization
Sparse coding
Noise-robust image classification
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