DeepNC: Deep Generative Network Completion

by   Cong Tran, et al.
University of Heidelberg
Yonsei University

Most network data are collected from only partially observable networks with both missing nodes and edges, for example due to limited resources and privacy settings specified by users on social media. Thus, it stands to the reason that inferring the missing parts of the networks by performing completion should precede downstream mining or learning tasks on the networks. However, despite this need, the recovery of missing nodes and edges in such incomplete networks is an insufficiently explored problem. In this paper, we present DeepNC, a novel method for inferring the missing parts of a network that is based on a deep generative graph model. Specifically, our model first learns a likelihood over edges via a recurrent neural network (RNN)-based generative graph, and then identifies the graph that maximizes the learned likelihood conditioned on the observable graph topology. Moreover, we propose a computationally efficient DeepNC algorithm that consecutively finds a single node to maximize the probability in each node generation step, whose runtime complexity is almost linear in the number of nodes in the network. We empirically show the superiority of DeepNC over state-of-the-art network completion approaches on a variety of synthetic and real-world networks.


page 1

page 2

page 3

page 4


SCGG: A Deep Structure-Conditioned Graph Generative Model

Deep learning-based graph generation approaches have remarkable capaciti...

Community Detection in Partially Observable Social Networks

The discovery of community structures in social networks has gained sign...

Graph Auto-Encoders for Network Completion

Completing a graph means inferring the missing nodes and edges from a pa...

Wasserstein diffusion on graphs with missing attributes

Missing node attributes is a common problem in real-world graphs. Graph ...

Efficient Graph Generation with Graph Recurrent Attention Networks

We propose a new family of efficient and expressive deep generative mode...

On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features

While Graph Neural Networks (GNNs) have recently become the de facto sta...

Network Inference by Learned Node-Specific Degree Prior

We propose a novel method for network inference from partially observed ...

Please sign up or login with your details

Forgot password? Click here to reset