mlsanityData to 7 Oct 2026

Clique pooling for graph classification

arXiv 1904.00374 ↗First posted 31 Mar 2019cs.LG stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Mar 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 4; 2023: 4; 2024: 2.

13 papers.

Sort: