Adversarial learning for multi-view network embedding on incomplete graphs

摘要

Network embedding, as a promising way of node representation learning, is capable of supporting various downstream network mining tasks, and has attracted growing research interests recently. Existing approaches mostly focus on learning the low-dimensional node representations by preserving the local or global topology information of a static network. It is difficult for such methods to learn desirable features for the nodes in an incomplete graph whose topology information is sparse or the new nodes in a dynamic graph. It is also challenging for them to deeply incorporate node attributes as the complementary information to improve the network embedding performance. To this end, in this paper we propose a Multi-View Adversarial learning based Network Embedding model named MVANE to deeply fuse the network topology information and node attributes to better perform network embedding on incomplete graphs. The insight is that the network topology and the node attributes are treated as two correlated views. The learned embedding vector of a node should be able to reveal its unique characteristics in both views. Specifically, the adversarial autoencoder is introduced as the basic model of MVANE. Autoencoder can learn a projection function to directly map the input feature vectors into the latent space, which ensures the MVANE learn embeddings for the new nodes through features projection without the need of retraining the model. Meanwhile, the adversarial learning strategy is also applied to better capture the cross-view correlations. The idea is that the learned embeddings in one view can not only reconstruct the inputs in this view, but also generate the features in another view. Under a unified learning framework, the latent representations in different views are fused and jointly reinforced by the proposed self/cross-view learning model. Empirically, we evaluate MVANE over multiple network datasets, and the results demonstrate the superiority of our proposal. (C) 2019 Elsevier B.V. All rights reserved.