Pith. sign in

REVIEW 1 cited by

A Comprehensive Survey on Graph 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 1901.00596 v4 pith:QORUPIWZ submitted 2019-01-03 cs.LG stat.ML

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

Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this survey, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art graph neural networks into four categories, namely recurrent graph neural networks, convolutional graph neural networks, graph autoencoders, and spatial-temporal graph neural networks. We further discuss the applications of graph neural networks across various domains and summarize the open source codes, benchmark data sets, and model evaluation of graph neural networks. Finally, we propose potential research directions in this rapidly growing field.

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. Full citation record

  1. Flow Matters: Directional and Expressive GNNs for Heterophilic Graphs

    cs.LG 2025-08 reject novelty 4.0 of 10

    A GAT model with polynomial gating (Poly) and a directed variant (Dir-Poly) report strong heterophilic node classification results, with Dir-Poly's largest gain on a single directed dataset.

Pith tools