SOTAVerified

A Flexible Generative Framework for Graph-based Semi-supervised Learning

2019-05-26NeurIPS 2019Code Available0· sign in to hype

Jiaqi Ma, Weijing Tang, Ji Zhu, Qiaozhu Mei

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We consider a family of problems that are concerned about making predictions for the majority of unlabeled, graph-structured data samples based on a small proportion of labeled samples. Relational information among the data samples, often encoded in the graph/network structure, is shown to be helpful for these semi-supervised learning tasks. However, conventional graph-based regularization methods and recent graph neural networks do not fully leverage the interrelations between the features, the graph, and the labels. In this work, we propose a flexible generative framework for graph-based semi-supervised learning, which approaches the joint distribution of the node features, labels, and the graph structure. Borrowing insights from random graph models in network science literature, this joint distribution can be instantiated using various distribution families. For the inference of missing labels, we exploit recent advances of scalable variational inference techniques to approximate the Bayesian posterior. We conduct thorough experiments on benchmark datasets for graph-based semi-supervised learning. Results show that the proposed methods outperform the state-of-the-art models in most settings.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
CiteseerG3NNAccuracy74.5Unverified
CiteSeer with Public Split: fixed 20 nodes per classG3NNAccuracy74.5Unverified
CoraG3NNAccuracy82.9Unverified
Cora with Public Split: fixed 20 nodes per classG3NNAccuracy82.9Unverified
PubmedG3NNAccuracy78.4Unverified
PubMed with Public Split: fixed 20 nodes per classG3NNAccuracy78.4Unverified

Reproductions