Pith. sign in

REVIEW 1 cited by

Data Augmentation on Graphs: A Technical Survey

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2212.09970 v3 pith:NOXO5B2S submitted 2022-12-20 cs.LG

Jiajun Zhou , Chenxuan Xie , Shengbo Gong , Zhenyu Wen , Xiangyu Zhao , Qi Xuan , Xiaoniu Yang This is my paper · ORCID
classification cs.LG
keywords datagraphsurveyaugmentationgdauggraphsprovidestechnical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In recent years, graph representation learning has achieved remarkable success while suffering from low-quality data problems. As a mature technology to improve data quality in computer vision, data augmentation has also attracted increasing attention in graph domain. To advance research in this emerging direction, this survey provides a comprehensive review and summary of existing graph data augmentation (GDAug) techniques. Specifically, this survey first provides an overview of various feasible taxonomies and categorizes existing GDAug studies based on multi-scale graph elements. Subsequently, for each type of GDAug technique, this survey formalizes standardized technical definition, discuss the technical details, and provide schematic illustration. The survey also reviews domain-specific graph data augmentation techniques, including those for heterogeneous graphs, temporal graphs, spatio-temporal graphs, and hypergraphs. In addition, this survey provides a summary of available evaluation metrics and design guidelines for graph data augmentation. Lastly, it outlines the applications of GDAug at both the data and model levels, discusses open issues in the field, and looks forward to future directions. The latest advances in GDAug are summarized in GitHub.

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. Multi-view Correlation-aware Network Traffic Detection on Flow Hypergraph

    cs.CR 2025-01 conditional novelty 5.0 of 10

    A hypergraph-based traffic classifier with multi-view features and dual contrastive learning reports modest but consistent accuracy and macro-F1 gains over baselines on five public datasets.

Pith tools