Node Pair Information Preserving Network Embedding Based on Adversarial Networks

2020 ◽  
pp. 1-15
Author(s):  
Chang-Dong Wang ◽  
Wei Shi ◽  
Ling Huang ◽  
Kun-Yu Lin ◽  
Dong Huang ◽  
...  
Author(s):  
Longcan Wu ◽  
Daling Wang ◽  
Shi Feng ◽  
Kaisong Song ◽  
Yifei Zhang ◽  
...  
Keyword(s):  

Author(s):  
Dongxiao He ◽  
Lu Zhai ◽  
Zhigang Li ◽  
Di Jin ◽  
Liang Yang ◽  
...  

Network embedding which is to learn a low dimensional representation of nodes in a network has been used in many network analysis tasks. Some network embedding methods, including those based on generative adversarial networks (GAN) (a promising deep learning technique), have been proposed recently. Existing GAN-based methods typically use GAN to learn a Gaussian distribution as a priori for network embedding. However, this strategy makes it difficult to distinguish the node representation from Gaussian distribution. Moreover, it does not make full use of the essential advantage of GAN (that is to adversarially learn the representation mechanism rather than the representation itself), leading to compromised performance of the method. To address this problem, we propose to use the adversarial idea on the representation mechanism, i.e. on the encoding mechanism under the framework of autoencoder. Specifically, we use the mutual information between node attributes and embedding as a reasonable alternative of this encoding mechanism (which is much easier to track). Additionally, we introduce another mapping mechanism (which is based on GAN) as a competitor into the adversarial learning system. A range of empirical results demonstrate the effectiveness of the proposed approach.


Author(s):  
Carl Yang ◽  
Jieyu Zhang ◽  
Jiawei Han

Network representation learning aims at transferring node proximity in networks into distributed vectors, which can be leveraged in various downstream applications. Recent research has shown that nodes in a network can often be organized in latent hierarchical structures, but without a particular underlying taxonomy, the learned node embedding is less useful nor interpretable. In this work, we aim to improve network embedding by modeling the conditional node proximity in networks indicated by node labels residing in real taxonomies. In the meantime, we also aim to model the hierarchical label proximity in the given taxonomies, which is too coarse by solely looking at the hierarchical topologies. Comprehensive experiments and case studies demonstrate the utility of TAXOGAN.


2019 ◽  
Vol 23 (3) ◽  
pp. 1925-1944 ◽  
Author(s):  
Xiaorui Qin ◽  
Yanghui Rao ◽  
Haoran Xie ◽  
Jian Yin ◽  
Fu Lee Wang

Sign in / Sign up

Export Citation Format

Share Document