Transfer Learning with Graph Co-Regularization

doi:10.1109/TKDE.2013.97

Transfer Learning with Graph Co-Regularization

2014-07-01

159

OA

AI

龙明盛 (Mingsheng Long) *

DOI：10.1109/TKDE.2013.97

Original

Save

View PDF

Abstract

En 中文

Transfer learning is established as an effective technology to leverage rich labeled data from some source domain to build an accurate classifier for the target domain. The basic assumption is that the input domains may share certain knowledge structure, which can be encoded into common latent factors and extracted by preserving important property of original data, e. g., statistical property and geometric structure. In this paper, we show that different properties of input data can be complementary to each other and exploring them simultaneously can make the learning model robust to the domain difference. We propose a general framework, referred to as Graph Co-Regularized Transfer Learning (GTL), where various matrix factorization models can be incorporated. Specifically, GTL aims to extract common latent factors for knowledge transfer by preserving the statistical property across domains, and simultaneously, refine the latent factors to alleviate negative transfer by preserving the geometric structure in each domain. Based on the framework, we propose two novel methods using NMF and NMTF, respectively. Extensive experiments verify that GTL can significantly outperform state-of-the-art learning methods on several public text and image datasets.

Keywords:

Transfer learning

negative transfer

graph regularization

matrix factorization

text mining

image classification

Transfer Learning with Graph Co-Regularization

Abstract

AI Summary

Journal

Organization