Exploring Correlations Among Tasks, Clusters, and Features for Multitask Clustering

被引:23
作者
Cao, Wenming [1 ]
Wu, Si [2 ]
Yu, Zhiwen [2 ]
Wong, Hau-San [1 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
[2] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Feature-cluster (FeaCluster) matrix; multitask clustering; relationship among tasks; shared information transfer; FEATURE-SELECTION;
D O I
10.1109/TNNLS.2018.2839114
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multitask clustering methods are proposed to improve performances of related tasks concurrently, because they explore the relationship among tasks via exploiting the coefficient matrix or the shared feature matrix. However, divergent effects of features in learning this relationship are seldom considered. To further improve performances, we propose a new multitask clustering approach through exploring correlations among tasks, clusters, and features based on effects of features on clusters. First, a Feature-Cluster (FeaCluster) matrix is introduced to capture the similarity and the distinct task-feature information simultaneously for each task. With the FeaCluster matrix, two affinities are calculated to constitute the interdependencies among tasks: the former is the graphical affinity based on feature-task and task-cluster correlations, while the latter is the reconstructive affinity. Here, the feature-task correlation considers effects of features on tasks, and the task-cluster correlation considers the overall effects of features on clusters. The reconstructive affinity is obtained by minimizing the reconstruction error when representing the FeaCluster matrix for a given task with a linear combination of others. The interdependencies among tasks allow transferring asymmetric shared information, exploring significant features and preserving key information when mapping data into the subspace. The experimental results on multiple data sets reveal that the proposed approach outperforms the state-of-theart clustering methods in terms of accuracy and normal mutual information.
引用
收藏
页码:355 / 368
页数:14
相关论文
共 38 条
[1]   Multitask learning [J].
Caruana, R .
MACHINE LEARNING, 1997, 28 (01) :41-75
[2]  
Dai Wenyuan, 2008, PROC 25 INT C MACH, P200
[3]  
Dhillon I. S., 2001, KDD-2001. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P269, DOI 10.1145/502512.502550
[4]  
Dhillon Inderjit S, 2004, P 10 ACM SIGKDD INT, P551, DOI DOI 10.1145/1014052.1014118
[5]   Incomplete Multisource Transfer Learning [J].
Ding, Zhengming ;
Shao, Ming ;
Fu, Yun .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 29 (02) :310-323
[6]  
Gu Q., 2011, P AAAI C ARTIFICIAL, P368
[7]   Learning the Shared Subspace for Multi-Task Clustering and Transductive Transfer Classification [J].
Gu, Quanquan ;
Zhou, Jie .
2009 9TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, 2009, :159-168
[8]  
Gu QQ, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P359
[9]  
He Jingrui, 2011, P 28 INT C MACH LEAR, P25
[10]  
Jin Y., 2016, MULTIDIMENSIONAL SYS, V28, P905