Pith. sign in

REVIEW 3 cited by

Graph Data Augmentation for Graph Machine Learning: A Survey

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 2202.08871 v2 pith:AD6D5UVC submitted 2022-02-17 cs.LG

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

Data augmentation has recently seen increased interest in graph machine learning given its demonstrated ability to improve model performance and generalization by added training data. Despite this recent surge, the area is still relatively under-explored, due to the challenges brought by complex, non-Euclidean structure of graph data, which limits the direct analogizing of traditional augmentation operations on other types of image, video or text data. Our work aims to give a necessary and timely overview of existing graph data augmentation methods; notably, we present a comprehensive and systematic survey of graph data augmentation approaches, summarizing the literature in a structured manner. We first introduce three different taxonomies for categorizing graph data augmentation methods from the data, task, and learning perspectives, respectively. Next, we introduce recent advances in graph data augmentation, differentiated by their methodologies and applications. We conclude by outlining currently unsolved challenges and directions for future research. Overall, our work aims to clarify the landscape of existing literature in graph data augmentation and motivates additional work in this area, providing a helpful resource for researchers and practitioners in the broader graph machine learning domain. Additionally, we provide a continuously updated reading list at https://github.com/zhao-tong/graph-data-augmentation-papers.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Attribute-Enhanced Similarity Ranking for Sparse Link Prediction

    cs.LG 2024-11 conditional novelty 6.0 of 10

    Under unbiased all-pairs evaluation, GNN link prediction performance drops sharply, and the proposed Gelato method, which learns attribute-weighted Autocovariance ranking, outperforms GNN baselines on most datasets.

  2. NAT-NL2GQL: A Novel Multi-Agent Framework for Translating Natural Language to Graph Query Language

    cs.CL 2024-12 conditional novelty 5.0 of 10

    A multi-agent LLM framework with schema extraction, fine-tuned query generation, and execution-error feedback outperforms prior NL2GQL systems on both a new nGQL dataset and the existing SpCQL benchmark.

  3. Self-Supervised Learning for Graph-Structured Data in Healthcare Applications: A Comprehensive Review

    cs.LG 2024-11 conditional novelty 4.0 of 10

    This review consolidates self-supervised graph learning methods for healthcare into contrastive, generative, and predictive categories, and surveys datasets, metrics, and open challenges.

Pith tools