Name
Abstract | ||
|---|---|---|
In unsupervised transfer learning, it is extremely valuable to effectively extract knowledge from the vast amount of untagged data that exists by utilizing tagged data from other similar databases. In general, the data in the real world often resides in the low-dimensional manifold embedded in the high-dimensional environment space. However, the current subspace transfer learning methods do not consider the nonlinear geometry structure inside the data, so the local similarity information between the data may be lost in the learning process. In order to improve this respect, we propose a new subspace transfer learning algorithm, namely Laplacian Regularized Low-Rank Sparse Representation Transfer Learning (LRLRSR-TL). After introducing the low-rank representation and sparse constraints, the method incorporates Laplacian regularization term to represent the global low-dimensional structure and capture the inherent nonlinear geometry information of the data. Experimental investigation conducted based on five different cross-domain visual image datasets shows that the proposed method has outstanding performance compared with several state-of-the-art transfer learning methods. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s13042-020-01203-6 | INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS |
Keywords | DocType | Volume |
Transfer learning, Representation matrix reconstruction, Regularization, Subspace learning | Journal | 12 |
Issue | ISSN | Citations |
3 | 1868-8071 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |