Please use this identifier to cite or link to this item:
Title: Sparse label propagation: a robust domain adaptation learning method
Authors: Tao, JW
Chung, FL 
Wang, ST
Yao, QF
Issue Date: 2015
Source: 軟件學報 (Journal of software), 2015, v. 26, no. 5, p. 977-1000
Abstract: Sparse representation has received an increasing amount of interest in pattern classification due to its robustness. In this paper, a domain adaptation learning (DAL) approach is explored based on a sparsity preserving model, which assumes that each data point can be sparsely reconstructed. The proposed robust DAL algorithm, called sparse label propagation domain adaptation learning (SLPDAL), propagates the labels from labeled points in the source domain to the unlabeled dataset in the target domain using those sparsely reconstructed objects with sufficient smoothness. SLPDAL consists of three steps. First, it finds an optimal kernel space in which all samples from both source and target domains can be embedded by minimizing the mean discrepancy between these two domains. Then, it computes the best kernel sparse reconstructed coefficients for each data point in the kernel space by using l1-norm minimization. Finally, it propagates the labels of source domain to the target domain by preserving the kernel sparse reconstructed coefficients. The paper also derives an easy way to extend SLPDAL to out-of-sample data and multiple kernel learning respectively. Promising experimental results have been obtained for several DAL problems such as face recognition, visual video detection and text classification tasks.
Keywords: Domain adaptation learning
Label propagation
Maximum mean discrepancy
Multiple kernel learning
Sparse representation
Publisher: 科學出版社
Journal: 軟件學報 (Journal of software) 
ISSN: 1000-9825
DOI: 10.13328/j.cnki.jos.004575
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Sep 6, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 13, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.