点击次数：

论文类型：期刊论文

发表时间：2016-12-01

发表刊物：IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING

收录刊物：SCIE、EI、Scopus

卷号：28

期号：12

页面范围：3324-3338

ISSN号：1041-4347

关键字：Multi-task multi-view clustering; multi-task clustering; multi-view clustering; co-clustering

摘要：Multi-task clustering and multi-view clustering have severally found wide applications and received much attention in recent years. Nevertheless, there are many clustering problems that involve both multi-task clustering and multi-view clustering, i.e., the tasks are closely related and each task can be analyzed from multiple views. In this paper, we introduce a multi-task multi-view clustering framework which integrates within-view-task clustering, multi-view relationship learning, and multi-task relationship learning. Under this framework, we propose two multi-task multi-view clustering algorithms, the bipartite graph based multi-task multi-view clustering algorithm, and the semi-nonnegative matrix tri-factorization based multi-task multi-view clustering algorithm. The former one can deal with the multi-task multi-view clustering of nonnegative data, the latter one is a general multi-task multi-view clustering method, i.e., it can deal with the data with negative feature values. Experimental results on publicly available data sets in web page mining and image mining show the superiority of the proposed multi-task multi-view clustering algorithms over either multi-task clustering algorithms or multi-view clustering algorithms for multi-task clustering of multi-view data.