# Pooling in Graph Convolutional Neural Networks

arXiv: https://arxiv.org/abs/2004.03519 · HTML: https://mlsanity.com/paper/2004.03519/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Apr 2020.

## Built on by (most cited first, 3 of 3)

- [Learning to Model the Relationship Between Brain Structural and Functional Connectomes](https://mlsanity.com/paper/2112.09906/) (2021)
- [Automatic Feature Recognition and Dimensional Attributes Extraction From CAD Models for Hybrid Additive-Subtractive Manufacturing](https://mlsanity.com/paper/2408.06891/) (2024)
- [Weaver: Kronecker Product Approximations of Spatiotemporal Attention for Traffic Network Forecasting](https://mlsanity.com/paper/2511.08888/) (2025)

## Abstract (arXiv)

Graph convolutional neural networks (GCNNs) are a powerful extension of deep learning techniques to graph-structured data problems. We empirically evaluate several pooling methods for GCNNs, and combinations of those graph pooling methods with three different architectures: GCN, TAGCN, and GraphSAGE. We confirm that graph pooling, especially DiffPool, improves classification accuracy on popular graph classification datasets and find that, on average, TAGCN achieves comparable or better accuracy than GCN and GraphSAGE, particularly for datasets with larger and sparser graph structures.