ACM Home Page
Please provide us with feedback. Feedback
Transfer learning from multiple source domains via consensus regularization
Full text PdfPdf (585 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
SESSION: KM: classification table of contents
Pages 103-112  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Ping Luo  HP Labs China, Beijing, China
Fuzhen Zhuang  Chinese Academy of Sciences, Beijing, China
Hui Xiong  Rutgers University, New Jersey, NJ, USA
Yuhong Xiong  HP Labs China, Beijing, China
Qing He  Chinese Academy of Sciences, Beijing, China
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 27,   Downloads (12 Months): 136,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458099
What is a DOI?

ABSTRACT

Recent years have witnessed an increased interest in transfer learning. Despite the vast amount of research performed in this field, there are remaining challenges in applying the knowledge learnt from multiple source domains to a target domain. First, data from multiple source domains can be semantically related, but have different distributions. It is not clear how to exploit the distribution differences among multiple source domains to boost the learning performance in a target domain. Second, many real-world applications demand this transfer learning to be performed in a distributed manner. To meet these challenges, we propose a consensus regularization framework for transfer learning from multiple source domains to a target domain. In this framework, a local classifier is trained by considering both local data available in a source domain and the prediction consensus with the classifiers from other source domains. In addition, the training algorithm can be implemented in a distributed manner, in which all the source-domains are treated as slave nodes and the target domain is used as the master node. To combine the training results from multiple source domains, it only needs share some statistical data rather than the full contents of their labeled data. This can modestly relieve the privacy concerns and avoid the need to upload all data to a central location. Finally, our experimental results show the effectiveness of our consensus regularization learning.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
A. Smeaton and P. Over. Trecvid: Benchmarking the effectiveness of information retrieval tasks on digital video. In Proc. of the Intl. Conf. on Image and Video Retrieval, 2003.
5
 
6
David Hosmer and Stanley Lemeshow. Applied Logistic Regression. Wiley, New York, 2000.
 
7
 
8
 
9
T. Joachims. Transductive learning via spectral graph partitioning. In Proc. of the 20th ICML, 2003.
10
11
12
13
 
14
Y. Grandvalet and Y. Bengio. Semi-supervised learning by entropy minimization. In Proc. of the 19th NIPS, pages 529--536, 2005.
 
15
16
 
17
 
18
V. Sindhwani, P. Niyogi, and M. Belkin. A co-regularization approach to semi-supervised learning with multiple views. In Proc. ICML Workshop on Learning with Multiple Views, 2005.
 
19
S. Dasgupta, M. L. Littman, and D. A. McAllester. Pac generalization bounds for co-training. In Proc. of the 15th NIPS, pages 375--382, 2001.
 
20
 
21

Collaborative Colleagues:
Ping Luo: colleagues
Fuzhen Zhuang: colleagues
Hui Xiong: colleagues
Yuhong Xiong: colleagues
Qing He: colleagues