| Graph-based transfer learning |
| Full text |
Pdf
(483 KB)
|
Source
|
Conference on Information and Knowledge Management
archive
Proceeding of the 18th ACM conference on Information and knowledge management
table of contents
Hong Kong, China
SESSION: KM classification and clustering II
table of contents
Pages: 937-946
Year of Publication: 2009
ISBN:978-1-60558-512-3
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 24, Downloads (12 Months): 74, Citation Count: 0
|
|
|
ABSTRACT
Transfer learning is the task of leveraging the information from labeled examples in some domains to predict the labels for examples in another domain. It finds abundant practical applications, such as sentiment prediction, image classification and network intrusion detection. In this paper, we propose a graph-based transfer learning framework. It propagates the label information from the source domain to the target domain via the example-feature-example tripartite graph, and puts more emphasis on the labeled examples from the target domain via the example-example bi-partite graph. Our framework is semi-supervised and non-parametric in nature and thus more flexible. We also develop an iterative algorithm so that our framework is scalable to large-scale applications. It enjoys the theoretical property of convergence. Compared with existing transfer learning methods, the proposed framework propagates the label information to both the features irrelevant to the source domain and the unlabeled examples in the target omain via the common features in a principled way. Experimental results on 3 real data sets demonstrate the effectiveness of our algorithm.
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
|
Kdd cup 99. In http://kdd.ics.uci.edu/databases/kddcup99/kddcup99.html, 1999.
|
| |
2
|
|
| |
3
|
|
| |
4
|
J. Blitzer, M. Dredze, and F. Pereira. Biographies, bollywood, boom--boxes and blenders: Domain adaptation for sentiment classification. In ACL, 2007.
|
| |
5
|
|
 |
6
|
Wenyuan Dai , Gui-Rong Xue , Qiang Yang , Yong Yu, Co-clustering based classification for out-of-domain documents, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, August 12-15, 2007, San Jose, California, USA
[doi> 10.1145/1281192.1281218]
|
 |
7
|
Wenyuan Dai , Qiang Yang , Gui-Rong Xue , Yong Yu, Boosting for transfer learning, Proceedings of the 24th international conference on Machine learning, p.193-200, June 20-24, 2007, Corvalis, Oregon
[doi> 10.1145/1273496.1273521]
|
| |
8
|
|
 |
9
|
Jing Gao , Wei Fan , Jing Jiang , Jiawei Han, Knowledge transfer via multiple model local structure mapping, Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2008, Las Vegas, Nevada, USA
[doi> 10.1145/1401890.1401928]
|
 |
10
|
Su-In Lee , Vassil Chatalbashev , David Vickrey , Daphne Koller, Learning a meta-level prior for feature relevance from multiple related tasks, Proceedings of the 24th international conference on Machine learning, p.489-496, June 20-24, 2007, Corvalis, Oregon
[doi> 10.1145/1273496.1273558]
|
 |
11
|
|
| |
12
|
Q. Liu, X. Liao, and L. Carin. Semi-supervised multitask learning. In NIPS, 2007.
|
| |
13
|
J. luc Gauvain and C. hui Lee. Maximum a posteriori estimation for multivariate gaussian mixture observations of markov chains. IEEE Transactions on Speech and Audio Processing, 2:291--298, 1994.
|
| |
14
|
A. M. Martinez. Recognition of partially occluded and/or imprecisely localized faces using a probabilistic approach. In CVPR, pages 1712--1717, 2000.
|
| |
15
|
B. Pang, L. Lee, and S. Vaithyanathan. Thumbs up? sentiment classification using machine learning techniques. CoRR, cs.CL/0205070, 2002.
|
| |
16
|
J. Rennie. 20 newsgroups. In http://people.csail.mit.edu/jrennie/20Newsgroups/, 2007.
|
| |
17
|
|
| |
18
|
H. Roger and J. Charles. Matrix Analysis. Cambridge University Press, 1985.
|
| |
19
|
S. Thrun. Is learning the n-th thing any easier than learning the first? In NIPS, pages 640--646. MIT Press, 1996.
|
 |
20
|
|
 |
21
|
|
 |
22
|
|
 |
23
|
|
| |
24
|
J. Zhang, Z. Ghahramani, and Y. Yang. Learning multiple related tasks using latent independent component analysis. In NIPS, 2005.
|
| |
25
|
D. Zhou, J. Weston, A. Gretton, O. Bousquet, and B. Scholkopf. Ranking on data manifolds. In NIPS, 2003.
|
| |
26
|
X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML, pages 912--919, 2003.
|
|