Clique pooling for graph classification

03/31/2019
by   Enxhell Luzhnica, et al.
0

We propose a novel graph pooling operation using cliques as the unit pool. As this approach is purely topological, rather than featural, it is more readily interpretable, a better analogue to image coarsening than filtering or pruning techniques, and entirely nonparametric. The operation is implemented within graph convolution network (GCN) and GraphSAGE architectures and tested against standard graph classification benchmarks. In addition, we explore the backwards compatibility of the pooling to regular graphs, demonstrating competitive performance when replacing two-by-two pooling in standard convolutional neural networks (CNNs) with our mechanism.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2020

Pooling in Graph Convolutional Neural Networks

Graph convolutional neural networks (GCNNs) are a powerful extension of ...
research
07/24/2023

Maximal Independent Sets for Pooling in Graph Neural Networks

Convolutional Neural Networks (CNNs) have enabled major advances in imag...
research
04/17/2019

Self-Attention Graph Pooling

Advanced methods of applying deep learning to structured data such as gr...
research
12/28/2020

LookHops: light multi-order convolution and pooling for graph classification

Convolution and pooling are the key operations to learn hierarchical rep...
research
08/23/2021

Understanding the Basis of Graph Convolutional Neural Networks via an Intuitive Matched Filtering Approach

Graph Convolutional Neural Networks (GCNN) are becoming a preferred mode...
research
05/09/2019

Convolutional Neural Networks Utilizing Multifunctional Spin-Hall MTJ Neurons

We propose a new network architecture for standard spin-Hall magnetic tu...
research
03/17/2021

Diversified Multiscale Graph Learning with Graph Self-Correction

Though the multiscale graph learning techniques have enabled advanced fe...

Please sign up or login with your details

Forgot password? Click here to reset