Neighborhood Random Walk Graph Sampling for Regularized Bayesian Graph Convolutional Neural Networks

  title={Neighborhood Random Walk Graph Sampling for Regularized Bayesian Graph Convolutional Neural Networks},
  author={Aneesh Komanduri and Justin Zhijun Zhan},
  journal={2021 20th IEEE International Conference on Machine Learning and Applications (ICMLA)},
  • Aneesh KomanduriJ. Zhan
  • Published 1 December 2021
  • Computer Science
  • 2021 20th IEEE International Conference on Machine Learning and Applications (ICMLA)
In the modern age of social media and networks, graph representations of real-world phenomena have become an incredibly useful source to mine insights. Often, we are interested in understanding how entities in a graph are interconnected. The Graph Neural Network (GNN) has proven to be a very useful tool in a variety of graph learning tasks including node classification, link prediction, and edge classification. However, in most of these tasks, the graph data we are working with may be noisy and… 
2 Citations

Tables from this paper

Improving Node Classification through Convolutional Networks Built on Enhanced Message-Passing Graph

This article addresses the problem via building GCN on Enhanced Message-Passing Graph by utilizing dropout to extract a group of variants from the EMPG and then builds multichannel GCNs on them and demonstrates that the proposed method yields improvements in node classification.

A General Framework for quantifying Aleatoric and Epistemic uncertainty in Graph Neural Networks

This work considers the problem of quantifying the uncertainty in predictions of GNN stemming from modeling errors and measurement uncertainty, and proposes an approach to treat both sources of uncertainty in a Bayesian framework, where Assumed Density Filtering is used to quantify aleatoric uncertainty and Monte Carlo dropout captures uncertainty in model parameters.



Bayesian graph convolutional neural networks for semi-supervised classification

A Bayesian GCNN framework is presented and an iterative learning procedure for the case of assortative mixed-membership stochastic block models is developed, demonstrating that the Bayesian formulation can provide better performance when there are very few labels available during the training process.

Bayesian Graph Convolutional Neural Networks using Node Copying

This paper introduces an alternative generative model for graphs based on copying nodes and incorporate it within the BGCN framework and shows that the proposed algorithm compares favorably to the state-of-the-art in benchmark node classification tasks.

A Framework for Recommending Accurate and Diverse Items Using Bayesian Graph Convolutional Neural Networks

This work takes a first step to introduce a principled way to model the uncertainty in the user-item interaction graph using the Bayesian Graph Convolutional Neural Network framework and demonstrates the effectiveness of the proposed framework on four benchmark recommendation datasets.

Bayesian Graph Neural Networks with Adaptive Connection Sampling

Experimental results with ablation studies on benchmark datasets validate that adaptively learning the sampling rate given graph training data is the key to boost the performance of GNNs in semi-supervised node classification, less prone to over-smoothing and over-fitting with more robust prediction.

Deep Convolutional Networks on Graph-Structured Data

This paper develops an extension of Spectral Networks which incorporates a Graph Estimation procedure, that is test on large-scale classification problems, matching or improving over Dropout Networks with far less parameters to estimate.

Graph Attention Networks

We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior

The Graph Neural Network Model

A new neural network model, called graph neural network (GNN) model, that extends existing neural network methods for processing the data represented in graph domains, and implements a function tau(G,n) isin IRm that maps a graph G and one of its nodes n into an m-dimensional Euclidean space.

Semi-Supervised Classification with Graph Convolutional Networks

A scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs which outperforms related methods by a significant margin.

Bootstrapping Graph Convolutional Neural Networks for Autism Spectrum Disorder Classification

This paper proposes a bootstrapped version of graph convolutional neural networks (G-CNNs) that utilizes an ensemble of weakly trained G- CNNs, and reduces the sensitivity of models on the choice of graph construction to demonstrate its effectiveness on the challenging Autism Brain Imaging Data Exchange (ABIDE) dataset.

Robust Spatial Filtering With Graph Convolutional Neural Networks

A novel neural learning framework that is capable of handling both homogeneous and heterogeneous data while retaining the benefits of traditional CNN successes is proposed, which is term Graph-CNNs, which can handle both heterogeneous and homogeneous graph data.