SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanism

01/20/2021
by   Qingyun Sun, et al.
0

Graph representation learning has attracted increasing research attention. However, most existing studies fuse all structural features and node attributes to provide an overarching view of graphs, neglecting finer substructures' semantics, and suffering from interpretation enigmas. This paper presents a novel hierarchical subgraph-level selection and embedding based graph neural network for graph classification, namely SUGAR, to learn more discriminative subgraph representations and respond in an explanatory way. SUGAR reconstructs a sketched graph by extracting striking subgraphs as the representative part of the original graph to reveal subgraph-level patterns. To adaptively select striking subgraphs without prior knowledge, we develop a reinforcement pooling mechanism, which improves the generalization ability of the model. To differentiate subgraph representations among graphs, we present a self-supervised mutual information mechanism to encourage subgraph embedding to be mindful of the global graph structural properties by maximizing their mutual information. Extensive experiments on six typical bioinformatics datasets demonstrate a significant and consistent improvement in model quality with competitive performance and interpretability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2021

Self-Supervised Dynamic Graph Representation Learning via Temporal Subgraph Contrast

Self-supervised learning on graphs has recently drawn a lot of attention...
research
09/22/2020

Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning

Graph representation learning has attracted lots of attention recently. ...
research
03/24/2021

Graph Representation Learning by Ensemble Aggregating Subgraphs via Mutual Information Maximization

Graph Neural Networks have shown tremendous potential on dealing with ga...
research
10/12/2020

Graph Information Bottleneck for Subgraph Recognition

Given the input graph and its label/property, several key problems of gr...
research
12/18/2021

Improving Subgraph Recognition with Variational Graph Information Bottleneck

Subgraph recognition aims at discovering a compressed substructure of a ...
research
03/20/2021

Recognizing Predictive Substructures with Subgraph Information Bottleneck

The emergence of Graph Convolutional Network (GCN) has greatly boosted t...
research
12/10/2020

Bipartite Graph Embedding via Mutual Information Maximization

Bipartite graph embedding has recently attracted much attention due to t...

Please sign up or login with your details

Forgot password? Click here to reset