.png){kind=icon}
Return
Unsupervised Multi-task Learning with Hierarchical Data Structure
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2018.08.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Unsupervised multi-task learning exploits the shared knowledge to improve performances by learning related tasks simultaneously. In this paper, we propose an unsupervised multi-task learning method with hierarchical data structure. It strengthens similarities between instances in the same cluster, and increases diversities of instances by utilizing instances from related clusters. Firstly, we introduce Representative Dual Features (RepDFs) that possess representative capabilities in the feature space and the sample space for each cluster concurrently. Secondly, we explore hierarchical structural similarities between clusters in related tasks from the topological perspective: 1) feature basis matrix, which learns compact representations for features in the feature space; and 2) sample refined matrix, which preserves local structures in the sample space. Thirdly, we adopt RepDFs to measure correlations between clusters and incorporate hierarchical structural similarities to conduct knowledge transfer among tasks. Experimental results on real-world data sets demonstrate the effectiveness and superiority of the proposed method over existing multi-task clustering methods. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Multi-task learning
hierarchical structure
unsupervised learning
structural similarity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveMechanical characterization of neural electrodes based on PDMS-parylene C-PDMS sandwiched system
PREAI
ShareSave
View more