Semi-Supervised Learning via Geodesic Weighted Sparse Representation

Jianqiao WANG  Yuehua LI  Jianfei CHEN  Yuanjiang LI  

IEICE TRANSACTIONS on Information and Systems   Vol.E97-D   No.6   pp.1673-1676
Publication Date: 2014/06/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E97.D.1673
Type of Manuscript: LETTER
Category: Pattern Recognition
label estimate,  geodesic distance,  sparse reconstruction,  semi-supervised learning,  

Full Text: PDF(420.3KB)>>
Buy this Article

The label estimation technique provides a new way to design semi-supervised learning algorithms. If the labels of the unlabeled data can be estimated correctly, the semi-supervised methods can be replaced by the corresponding supervised versions. In this paper, we propose a novel semi-supervised learning algorithm, called Geodesic Weighted Sparse Representation (GWSR), to estimate the labels of the unlabeled data. First, the geodesic distance and geodesic weight are calculated. The geodesic weight is utilized to reconstruct the labeled samples. The Euclidean distance between the reconstructed labeled sample and the unlabeled sample equals the geodesic distance between the original labeled sample and the unlabeled sample. Then, the unlabeled samples are sparsely reconstructed and the sparse reconstruction weight is obtained by minimizing the L1-norm. Finally, the sparse reconstruction weight is utilized to estimate the labels of the unlabeled samples. Experiments on synthetic data and USPS hand-written digit database demonstrate the effectiveness of our method.