Discriminative and informative joint distribution adaptation for unsupervised domain adaptation

被引:29
作者
Yang, Liran [1 ]
Zhong, Ping [2 ]
机构
[1] China Agr Univ, Coll Informat & Elect Engn, Beijing 100083, Peoples R China
[2] China Agr Univ, Coll Sci, Beijing 100083, Peoples R China
关键词
Domain adaptation; Joint distribution adaptation; Maximum margin criterion; Row-sparsity; TRANSFER SUBSPACE; LOW-RANK; FRAMEWORK; KERNEL; REGULARIZATION; REPRESENTATION;
D O I
10.1016/j.knosys.2020.106394
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Domain adaptation learning is proposed as an effective technology for leveraging rich supervision knowledge from the related domain(s) to learn a reliable classifier for a new domain. One popular kind of domain adaptation methods is based on feature representation. However, such methods fail to consider the within-class and between-class relations after obtaining the new representation. In addition, they do not consider the negative effects of features that might be redundant or irrelevant to the final classification. To this end, a novel domain-invariant feature learning method based on the maximum margin criterion and sparsity technique for unsupervised domain adaptation is proposed in this paper, referred to as discriminative and informative joint distribution adaptation (DIJDA). Specifically, DIJDA adopts the maximum margin criterion in the adaptation process such that the transformed samples are near to those in the same class but segregated from those in different classes. As a result, the discriminative knowledge referred from source labels can be transferred to target domain effectively. Moreover, DIJDA imposes a row-sparsity constraint on the transformation matrix, which enforces rows of the matrix corresponding to inessential feature attributes to be all zero. Therefore, the most informative feature attributes can be extracted. Compared with several state-ofthe-art methods, DIJDA substantially improves the classification results on five widely used benchmark datasets, which demonstrates the effectiveness of the proposed method. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:13
相关论文
共 55 条
[1]  
[Anonymous], 2014, ABS14123474 CORR
[2]  
[Anonymous], 2007, P ACM MM
[3]  
Belkin M, 2006, J MACH LEARN RES, V7, P2399
[4]  
Blitzer J., 2006, P C EMP METH NAT LAN, P120, DOI DOI 10.3115/1610075.1610094
[5]   Domain Adaptation Problems: A DASVM Classification Technique and a Circular Validation Strategy [J].
Bruzzone, Lorenzo ;
Marconcini, Mattia .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2010, 32 (05) :770-787
[6]  
Cao Y, 2018, AAAI CONF ARTIF INTE, P2795
[7]   Joint Domain Matching and Classification for cross-domain adaptation via ELM [J].
Chen, Chao ;
Jiang, Buyuan ;
Cheng, Zhaowei ;
Jin, Xinyu .
NEUROCOMPUTING, 2019, 349 :314-325
[8]  
Demsar J, 2006, J MACH LEARN RES, V7, P1
[9]  
Duan LX, 2009, PROC CVPR IEEE, P1375, DOI [10.1109/CVPRW.2009.5206747, 10.1109/CVPR.2009.5206747]
[10]  
Ganin Y, 2016, J MACH LEARN RES, V17