MTGK: Multi-Source Cross-Network Node Classification via Transferable Graph Knowledge

Author(s):  
Hongwei Yang ◽  
Hui He ◽  
Weizhe Zhang ◽  
Yawen Bai
2020 ◽  
Vol 34 (03) ◽  
pp. 2991-2999 ◽  
Author(s):  
Xiao Shen ◽  
Quanyu Dai ◽  
Fu-lai Chung ◽  
Wei Lu ◽  
Kup-Sze Choi

In this paper, the task of cross-network node classification, which leverages the abundant labeled nodes from a source network to help classify unlabeled nodes in a target network, is studied. The existing domain adaptation algorithms generally fail to model the network structural information, and the current network embedding models mainly focus on single-network applications. Thus, both of them cannot be directly applied to solve the cross-network node classification problem. This motivates us to propose an adversarial cross-network deep network embedding (ACDNE) model to integrate adversarial domain adaptation with deep network embedding so as to learn network-invariant node representations that can also well preserve the network structural information. In ACDNE, the deep network embedding module utilizes two feature extractors to jointly preserve attributed affinity and topological proximities between nodes. In addition, a node classifier is incorporated to make node representations label-discriminative. Moreover, an adversarial domain adaptation technique is employed to make node representations network-invariant. Extensive experimental results demonstrate that the proposed ACDNE model achieves the state-of-the-art performance in cross-network node classification.


2021 ◽  
Author(s):  
Xiaowen Zhang ◽  
Yuntao Du ◽  
Rongbiao Xie ◽  
Chongjun Wang

Author(s):  
Ting Guo ◽  
Xingquan Zhu ◽  
Jian Pei ◽  
Chengqi Zhang

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
H. Zhang ◽  
J. J. Zhou ◽  
R. Li

Graph embedding aims to learn the low-dimensional representation of nodes in the network, which has been paid more and more attention in many graph-based tasks recently. Graph Convolution Network (GCN) is a typical deep semisupervised graph embedding model, which can acquire node representation from the complex network. However, GCN usually needs to use a lot of labeled data and additional expressive features in the graph embedding learning process, so the model cannot be effectively applied to undirected graphs with only network structure information. In this paper, we propose a novel unsupervised graph embedding method via hierarchical graph convolution network (HGCN). Firstly, HGCN builds the initial node embedding and pseudo-labels for the undirected graphs, and then further uses GCNs to learn the node embedding and update labels, finally combines HGCN output representation with the initial embedding to get the graph embedding. Furthermore, we improve the model to match the different undirected networks according to the number of network node label types. Comprehensive experiments demonstrate that our proposed HGCN and HGCN∗ can significantly enhance the performance of the node classification task.


Sign in / Sign up

Export Citation Format

Share Document