Graph Neural Networks

Recent momentum

-19%

34 papers in the last 28 days · 0.5% of indexed attention

Twelve weeks of publication activity for this topic as it is defined today.

Weekly history

Recent digests

What was published in this topic, kept on the site without email delivery.

Period ending 2026-09-21

10 new papers

A weekly snapshot of new work published in Graph Neural Networks.

Period ending 2026-09-14

10 new papers

A weekly snapshot of new work published in Graph Neural Networks.

Period ending 2026-09-07

12 new papers

A weekly snapshot of new work published in Graph Neural Networks.

422 papers

Latest in Graph Neural Networks

Nov 1, 2023cs.CL

Semantic Representation Learning of Scientific Literature based on Adaptive Feature and Graph Neural Network

Because most scientific literature data are unlabeled, semantic representation learning based on unsupervised graphs has become crucial. To enrich scientific-literature features, this paper proposes a semantic representation learning method based on adaptive features and graph neural networks. By introducing adaptive feature processing, scientific-literature features are considered globally and locally. The graph attention mechanism weights and aggregates features of scientific documents connected by citation relations, so that correlations among different documents can be expressed more effectively. In addition, an unsupervised graph neural network semantic representation learning method is proposed. By comparing the mutual information between positive and negative local semantic representations of scientific literature and the global graph semantic representation in the latent space, the graph neural network captures local and global information and improves semantic representation learning. Experimental results show that the proposed method is competitive for scientific literature classification.
Hongrui Gao, Yawen Li, Meiyu Liang +2
Jun 22, 2023cs.LG

Efficient Partitioning Method of Large-Scale Public Safety Spatio-Temporal Data based on Information Loss Constraints

The storage, management, and application of massive spatio-temporal data are widely used in practical scenarios, including public safety. However, due to the unique spatio-temporal distribution characteristics of real-world data, existing methods still face limitations in preserving spatio-temporal proximity and achieving load balancing in distributed storage. This paper proposes an efficient partitioning method for large-scale public safety spatio-temporal data based on information loss constraints, named IFL-LSTP. The model combines a spatio-temporal partitioning module (STPM) and a graph partitioning module (GPM). STPM reduces the scale of data under a predefined information-loss threshold, while GPM uses graph representation learning to obtain balanced graph partitions. Experiments on multiple real-world datasets show that IFL-LSTP can reduce data scale, shorten graph model training time, preserve spatio-temporal proximity, and improve load-balancing effectiveness.
Jie Gao, Yawen Li, Zhe Xue +1