TY - JOUR
T1 - Geometric Knowledge Embedding for unsupervised domain adaptation
AU - Wu, Hanrui
AU - Yan, Yuguang
AU - Ye, Yuzhong
AU - Ng, Michael K.
AU - Wu, Qingyao
N1 - This work was supported by National Natural Science Foundation of China (NSFC) 61876208; Guangdong Provincial Scientific and Technological funds, China 2017B090901008, 2018B010108002; Natural Science Foundation of Guangdong Province, China 2015A030310446; National Key R&D Program of China 2018YFC0830900; Pre-Research Foundation of China 61400010205; Pearl River S&T Nova Program of Guangzhou, China 201806010081; CCF-Tencent Open Research Fund, China RAGR20190103; and Hong Kong Research Grants Council GRF 12306616, 12200317, 12300218 and 12300519.
Publisher Copyright:
© 2019 Elsevier B.V.
PY - 2020/3/5
Y1 - 2020/3/5
N2 - Domain adaptation aims to transfer auxiliary knowledge from a source domain to enhance the learning performance on a target domain. Recent studies have suggested that deep networks are able to achieve promising results for domain adaptation problems. However, deep neural networks cannot reveal the underlying geometric information from input data. Indeed, such geometric information is very useful for describing the relationship between the samples from source and target domains. In this paper, we propose a novel learning algorithm named GKE, which stands for Geometric Knowledge Embedding. In GKE, we use a graph-based model to explore the underlying geometric structure of the input source and target data based on their similarities. Concretely, we develop a graph convolutional network to learn discriminative representations based on the constructed graph. To obtain effective transferable representations, we match source and target domains by reducing the Maximum Mean Discrepancy (MMD) between their learned representations. Extensive experiments on real-world data sets demonstrate that the proposed method outperforms existing domain adaption methods.
AB - Domain adaptation aims to transfer auxiliary knowledge from a source domain to enhance the learning performance on a target domain. Recent studies have suggested that deep networks are able to achieve promising results for domain adaptation problems. However, deep neural networks cannot reveal the underlying geometric information from input data. Indeed, such geometric information is very useful for describing the relationship between the samples from source and target domains. In this paper, we propose a novel learning algorithm named GKE, which stands for Geometric Knowledge Embedding. In GKE, we use a graph-based model to explore the underlying geometric structure of the input source and target data based on their similarities. Concretely, we develop a graph convolutional network to learn discriminative representations based on the constructed graph. To obtain effective transferable representations, we match source and target domains by reducing the Maximum Mean Discrepancy (MMD) between their learned representations. Extensive experiments on real-world data sets demonstrate that the proposed method outperforms existing domain adaption methods.
KW - Domain adaptation
KW - Geometric knowledge
KW - Graph convolutional network
KW - Graph-based model
KW - Maximum Mean Discrepancy
UR - http://www.scopus.com/inward/record.url?scp=85075460455&partnerID=8YFLogxK
U2 - 10.1016/j.knosys.2019.105155
DO - 10.1016/j.knosys.2019.105155
M3 - Journal article
AN - SCOPUS:85075460455
SN - 0950-7051
VL - 191
JO - Knowledge-Based Systems
JF - Knowledge-Based Systems
M1 - 105155
ER -