Pith. sign in

REVIEW 1 cited by

Data-centric Graph 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 2310.04987 v3 pith:J4ZQ7FGV submitted 2023-10-08 cs.LG cs.SI

classification cs.LGcs.SI
keywords graphdatalearningdata-centricmodelsapproachesdeepneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The history of artificial intelligence (AI) has witnessed the significant impact of high-quality data on various deep learning models, such as ImageNet for AlexNet and ResNet. Recently, instead of designing more complex neural architectures as model-centric approaches, the attention of AI community has shifted to data-centric ones, which focuses on better processing data to strengthen the ability of neural models. Graph learning, which operates on ubiquitous topological data, also plays an important role in the era of deep learning. In this survey, we comprehensively review graph learning approaches from the data-centric perspective, and aim to answer three crucial questions: (1) when to modify graph data, (2) what part of the graph data needs modification to unlock the potential of various graph models, and (3) how to safeguard graph models from problematic data influence. Accordingly, we propose a novel taxonomy based on the stages in the graph learning pipeline, and highlight the processing methods for different data structures in the graph data, i.e., topology, feature and label. Furthermore, we analyze some potential problems embedded in graph data and discuss how to solve them in a data-centric manner. Finally, we provide some promising future directions for data-centric graph learning.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Redundancy Is All You Need (for CSP Sparsification)

    cs.DS 2024-11 unverdicted novelty 8.0 of 10

    For any CSP predicate R, unweighted CSP(R) instances admit sparsifiers of size at most their non-redundancy (up to polylog factors); weighted cases are pinned to chain length, via a VC-type theorem for set families us...

Pith tools