Learning the Shared Subspace for Multi-Task Clustering and Transductive Transfer Classification

被引:97
作者
Gu, Quanquan [1 ]
Zhou, Jie [1 ]
机构
[1] Tsinghua Univ, State Key Lab Intelligent Technol & Syst, Tsinghua Natl Lab Informat Sci & Technol TNList, Dept Automat, Beijing 100084, Peoples R China
来源
2009 9TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING | 2009年
关键词
multi-task clustering; transductive transfer classification; multi-task learning; transfer learning; cross domain classification; domain adaption;
D O I
10.1109/ICDM.2009.32
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
There are many clustering tasks which are closely related in the real world, e.g. clustering the web pages of different universities. However, existing clustering approaches neglect the underlying relation and treat these clustering tasks either individually or simply together. In this paper, we will study a novel clustering paradigm, namely multi-task clustering, which performs multiple related clustering tasks together and utilizes the relation of these tasks to enhance the clustering performance. We aim to learn a subspace shared by all the tasks, through which the knowledge of the tasks can be transferred to each other. The objective of our approach consists of two parts: (1) Within-task clustering: clustering the data of each task in its input space individually; and (2) Cross-task clustering: simultaneous learning the shared subspace and clustering the data of all the tasks together. We will show that it can be solved by alternating minimization, and its convergence is theoretically guaranteed. Furthermore, we will show that given the labels of one task, our multi-task clustering method can be extended to transductive transfer classification (a.k.a. cross-domain classification, domain adaption). Experiments on several cross-domain text data sets demonstrate that the proposed multi-task clustering outperforms traditional single-task clustering methods greatly. And the transductive transfer classification method is comparable to or even better than several existing transductive transfer classification approaches.
引用
收藏
页码:159 / 168
页数:10
相关论文
共 39 条
[1]  
Ando RK, 2005, J MACH LEARN RES, V6, P1817
[2]  
[Anonymous], 2005, Proceedings of the 22nd International Conference on Machine Learning
[3]  
[Anonymous], HKUSTCS0808 DEP COMP
[4]  
[Anonymous], INT C MACH LEARN
[5]  
Argyriou A., 2006, P 19 INT C NEUR INF, P41, DOI DOI 10.1007/S10994-007-5040-8
[6]  
BASU, 2004, SIGKDD 10, P59
[7]  
Boyd Stephen, 2004, Convex Optimization, DOI DOI 10.1017/CBO9780511804441
[8]   Non-negative Matrix Factorization on Manifold [J].
Cai, Deng ;
He, Xiaofei ;
Wu, Xiaoyun ;
Han, Jiawei .
ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2008, :63-+
[9]   Multitask learning [J].
Caruana, R .
MACHINE LEARNING, 1997, 28 (01) :41-75
[10]  
Chen J., 2009, International Research Journal of Finance and Economics, V34, P18