Graph Domain Adaptation
Several domain adaptation methods model data with a graph and make use of the assumption that the label function varies smoothly on the graph 4 16 17.
Graph domain adaptation. 2 1 spectral embedding of brain graphs. Domain adaptation with adversarial training and graph embeddings. The existing domain adaptation approaches which tackle this problem work in the closed set setting with the assumption that the source and the target data share exactly the same classes of objects.
Unsupervised graph domain adaptation is to take advantage of the rich labeled information from the source network to help build an accurate node classi er for the target network. Unsupervised domain adaptation uda methods aim to reduce annotation efforts when generalizing deep learning models to new domains. However uda on graph domains has not been investigated yet.
Finally a graph domain adaptation network is trained to perform alignment independent parcellation. We studied this problem in our previous work 5 where we proposed a method called spectral domain adaptation sda. Uda has been widely studied in medical image domains.
Abstract graph and subspace learning for domain adaptation by le shu doctor of philosophy in computer and information sciences temple university in philadelphia october 2015. The spectral coordinates and sulcal depth of cortical points to cortical parcel labels. This is forked form the implementation of planetoid a graph based semi supervised learning method proposed in the following paper.
In this paper we exploit this technique to learn surface data across inconsistent graph alignments. Adversarial training is widely used for unsupervised domain adaptation to improve segmentation performance on target data whose distribution differs from the training source data. In this paper we present the first attempt of unsupervised graph domain adaptation in medical.
Please be patient we are slowly uploading code and preparing readme file. Then the purpose of graph domain adaptation is to transfer this information to a target graph that contains very few labels and estimate the unknown class labels. Revisiting semi supervised learning with graph embeddings.