Exploring Fine-Grained Cluster Structure Knowledge for Unsupervised Domain Adaptation

被引:17
作者
Meng, Min [1 ]
Wu, Zhuanghui [1 ]
Liang, Tianyou [1 ]
Yu, Jun [2 ]
Wu, Jigang [1 ]
机构
[1] Guangdong Univ Technol, Sch Comp Sci, Guangzhou 510006, Peoples R China
[2] Hangzhou Dianzi Univ, Sch Comp Sci, Hangzhou 310018, Peoples R China
基金
中国国家自然科学基金;
关键词
Representation learning; Adaptation models; Predictive models; Measurement; Feature extraction; Data models; Data visualization; Unsupervised domain adaptation; discriminative clustering; structural representation learning; structural centroid-based label prediction;
D O I
10.1109/TCSVT.2022.3151387
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Unsupervised domain adaptation aims to leverage knowledge from a labeled source domain to learn an accurate model in an unlabeled target domain. However, many previous approaches propose to learn domain agnostic feature representations using a global distribution alignment objective, which does not consider the fine-grained cluster structures in the source and target domains. As such, the goal of this paper is to address two challenging problems: 1) how to thoroughly explore fine-grained cluster structure knowledge in the source and target domains, 2) how to effectively incorporate these structure knowledge for adaptation. Regarding the first point, we are motivated by structural domain similarity assumption and propose structural representation learning, which is achieved by enforcing structural consistency between the source and target domains while retaining their individual discriminative properties. Regarding the second point, we firstly devise a novel structural centroid-based label prediction method, which explicitly models structural representations to form discriminative source and target cluster centroids, and estimates the label distribution of each target sample through the cosine similarity between its corresponding target cluster centroid and all the other source cluster centroids. Then, we adopt clustering learning to incorporate these discriminative structure knowledge for adaptation by minimizing the KL divergence between the predictive target label distribution and an introduced auxiliary one. Comprehensive experiments and analyses on four benchmark datasets demonstrate the superiority of the proposed discriminative clustering framework.
引用
收藏
页码:5481 / 5494
页数:14
相关论文
共 77 条
[1]  
[Anonymous], 2009, P COLT
[2]  
[Anonymous], 2019, PR MACH LEARN RES
[3]   A theory of learning from different domains [J].
Ben-David, Shai ;
Blitzer, John ;
Crammer, Koby ;
Kulesza, Alex ;
Pereira, Fernando ;
Vaughan, Jennifer Wortman .
MACHINE LEARNING, 2010, 79 (1-2) :151-175
[4]  
Caputo B, 2014, INT C CROSS LANG EV, P192, DOI DOI 10.1007/978-3-319-11382-118
[5]   Deep Clustering for Unsupervised Learning of Visual Features [J].
Caron, Mathilde ;
Bojanowski, Piotr ;
Joulin, Armand ;
Douze, Matthijs .
COMPUTER VISION - ECCV 2018, PT XIV, 2018, 11218 :139-156
[6]   Unsupervised domain adaptation based on cluster matching and Fisher criterion for image classification [J].
Chang, Heyou ;
Zhang, Fanlong ;
Ma, Shuai ;
Gao, Guangwei ;
Zheng, Hao ;
Chen, Yang .
COMPUTERS & ELECTRICAL ENGINEERING, 2021, 91
[7]  
Chen QC, 2020, AAAI CONF ARTIF INTE, V34, P10567
[8]   Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situations [J].
Cui, Shuhao ;
Wang, Shuhui ;
Zhuo, Junbao ;
Li, Liang ;
Huang, Qingming ;
Tian, Qi .
2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2020, :3940-3949
[9]   Gradually Vanishing Bridge for Adversarial Domain Adaptation [J].
Cui, Shuhao ;
Wang, Shuhui ;
Zhuo, Junbao ;
Su, Chi ;
Huang, Qingming ;
Tian, Qi .
2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2020), 2020, :12452-12461
[10]  
Deng J, 2009, PROC CVPR IEEE, P248, DOI 10.1109/CVPRW.2009.5206848