Pith. sign in

REVIEW 1 cited by

GraphCrop: Subgraph Cropping for Graph Classification

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 2009.10564 v1 pith:RJSBJNFM submitted 2020-09-22 cs.SI cs.AI

classification cs.SIcs.AI
keywords graphgraphcropclassificationgnnssubgraphcroppingexistingmethod
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a new method to regularize graph neural networks (GNNs) for better generalization in graph classification. Observing that the omission of sub-structures does not necessarily change the class label of the whole graph, we develop the \textbf{GraphCrop} (Subgraph Cropping) data augmentation method to simulate the real-world noise of sub-structure omission. In principle, GraphCrop utilizes a node-centric strategy to crop a contiguous subgraph from the original graph while maintaining its connectivity. By preserving the valid structure contexts for graph classification, we encourage GNNs to understand the content of graph structures in a global sense, rather than rely on a few key nodes or edges, which may not always be present. GraphCrop is parameter learning free and easy to implement within existing GNN-based graph classifiers. Qualitatively, GraphCrop expands the existing training set by generating novel and informative augmented graphs, which retain the original graph labels in most cases. Quantitatively, GraphCrop yields significant and consistent gains on multiple standard datasets, and thus enhances the popular GNNs to outperform the baseline methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Graph Neural Networks for Jamming Source Localization

    cs.NI 2025-06 conditional novelty 6.0 of 10

    A graph neural network with a learned confidence-based fusion of a weighted-centroid prior localizes jamming sources in simulated wireless networks, outperforming classical and learning-based baselines.

Pith tools