Non-Parametric Graph Learning for Bayesian Graph Neural Networks
Graphs are ubiquitous in modelling relational structures. Recent endeavours in machine learning for graph-structured data have led to many architectures and learning algorithms. However, the graph used by these algorithms is often constructed based on inaccurate modelling assumptions and/or noisy data. As a result, it fails to represent the true relationships between nodes. A Bayesian framework which targets posterior inference of the graph by considering it as a random quantity can be beneficial. In this paper, we propose a novel non-parametric graph model for constructing the posterior distribution of graph adjacency matrices. The proposed model is flexible in the sense that it can effectively take into account the output of graph-based learning algorithms that target specific tasks. In addition, model inference scales well to large graphs. We demonstrate the advantages of this model in three different problem settings: node classification, link prediction and recommendation.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph LearningLink PredictionNode ClassificationSimilar Papers 제목 키워드 기반
Bayesian Graph Convolutional Neural Networks Using Non-Parametric Graph Learning
Graph convolutional neural networks (GCNN) have been successfully applied to many different graph based learning tasks including node and graph classification, matrix completion, and learning of node embeddings. Despite …
Bayesian InferenceGeneral ClassificationGraph ClassificationGraph Learning+2Nonparametric Bayesian label prediction on a graph
An implementation of a nonparametric Bayesian approach to solving binary classification problems on graphs is described. A hierarchical Bayesian approach with a randomly scaled Gaussian prior is considered. The prior use…
Binary ClassificationGeneral ClassificationPredictionNonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization
This article describes an implementation of a nonparametric Bayesian approach to solving binary classification problems on graphs. We consider a hierarchical Bayesian approach with a prior that is constructed by truncati…
Binary ClassificationGeneral ClassificationBayesian Models of Graphs, Arrays and Other Exchangeable Random Structures
The natural habitat of most Bayesian methods is data represented by exchangeable sequences of observations, for which de Finetti's theorem provides the theoretical foundation. Dirichlet process clustering, Gaussian proce…
ClusteringCollaborative FilteringLink PredictionSemi-parametric Expert Bayesian Network Learning with Gaussian Processes and Horseshoe Priors
This paper proposes a model learning Semi-parametric rela- tionships in an Expert Bayesian Network (SEBN) with linear parameter and structure constraints. We use Gaussian Pro- cesses and a Horseshoe prior to introduce mi…
Gaussian Processes