English

DINE: A Framework for Deep Incomplete Network Embedding

Social and Information Networks 2020-08-17 v1 Machine Learning

Abstract

Network representation learning (NRL) plays a vital role in a variety of tasks such as node classification and link prediction. It aims to learn low-dimensional vector representations for nodes based on network structures or node attributes. While embedding techniques on complete networks have been intensively studied, in real-world applications, it is still a challenging task to collect complete networks. To bridge the gap, in this paper, we propose a Deep Incomplete Network Embedding method, namely DINE. Specifically, we first complete the missing part including both nodes and edges in a partially observable network by using the expectation-maximization framework. To improve the embedding performance, we consider both network structures and node attributes to learn node representations. Empirically, we evaluate DINE over three networks on multi-label classification and link prediction tasks. The results demonstrate the superiority of our proposed approach compared against state-of-the-art baselines.

Keywords

Cite

@article{arxiv.2008.06311,
  title  = {DINE: A Framework for Deep Incomplete Network Embedding},
  author = {Ke Hou and Jiaying Liu and Yin Peng and Bo Xu and Ivan Lee and Feng Xia},
  journal= {arXiv preprint arXiv:2008.06311},
  year   = {2020}
}

Comments

12 pages, 3 figures