Node Copying: A Random Graph Model for Effective Graph Sampling

by   Florence Regol, et al.

There has been an increased interest in applying machine learning techniques on relational structured-data based on an observed graph. Often, this graph is not fully representative of the true relationship amongst nodes. In these settings, building a generative model conditioned on the observed graph allows to take the graph uncertainty into account. Various existing techniques either rely on restrictive assumptions, fail to preserve topological properties within the samples or are prohibitively expensive for larger graphs. In this work, we introduce the node copying model for constructing a distribution over graphs. Sampling of a random graph is carried out by replacing each node's neighbors by those of a randomly sampled similar node. The sampled graphs preserve key characteristics of the graph structure without explicitly targeting them. Additionally, sampling from this model is extremely simple and scales linearly with the nodes. We show the usefulness of the copying model in three tasks. First, in node classification, a Bayesian formulation based on node copying achieves higher accuracy in sparse data settings. Second, we employ our proposed model to mitigate the effect of adversarial attacks on the graph topology. Last, incorporation of the model in a recommendation system setting improves recall over state-of-the-art methods.


page 1

page 2

page 3

page 4


Bayesian Graph Convolutional Neural Networks using Node Copying

Graph convolutional neural networks (GCNN) have numerous applications in...

Non-Parametric Graph Learning for Bayesian Graph Neural Networks

Graphs are ubiquitous in modelling relational structures. Recent endeavo...

Adversarial Attacks on Neural Networks for Graph Data

Deep learning models for graphs have achieved strong performance for the...

Adversarial Attacks on Classification Models for Graphs

Deep learning models for graphs have achieved strong performance for the...

Node Copying for Protection Against Graph Neural Network Topology Attacks

Adversarial attacks can affect the performance of existing deep learning...

A Neural Turing Machine for Conditional Transition Graph Modeling

Graphs are an essential part of many machine learning problems such as a...

Learning to Learn Graph Topologies

Learning a graph topology to reveal the underlying relationship between ...

Please sign up or login with your details

Forgot password? Click here to reset