Pith. sign in

REVIEW

Pooling in Graph Convolutional Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.03519 v1 pith:TXLGG2BZ submitted 2020-04-07 eess.SP cs.LG

classification eess.SPcs.LG
keywords graphpoolingaccuracyclassificationconvolutionaldatasetsgcnnsgraphsage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools