Input Snapshots Fusion for Scalable Discrete-Time Dynamic Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
In recent years, there has been a surge in research on dynamic graph representation learning, primarily focusing on modeling the evolution of temporal-spatial patterns in real-world applications. However, within the domain of discrete-time dynamic graphs, the exploration of temporal edges remains underexplored. Existing approaches often rely on additional sequential models to capture dynamics, leading to high computational and memory costs, particularly for large-scale graphs. To address this limitation, we propose the Input bf Snapshots bf Fusion based bf Dynamic bf Graph Neural Network (SFDyG), which combines Hawkes processes with graph neural networks to capture temporal and structural patterns in dynamic graphs effectively. By fusing multiple snapshots into a single temporal graph, SFDyG decouples computational complexity from the number of snapshots, enabling efficient full-batch and mini-batch training. Experimental evaluations on eight diverse dynamic graph datasets for future link prediction tasks demonstrate that SFDyG consistently outperforms existing methods.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 32 of its 46 references that are in the map. First posted on arXiv 11 May 2024.
Builds on
32 of 46 references.
References · 32
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2017Spatio-Temporal Graph Convolutional Networks: A Deep Learning Framework for Traffic Forecastingcited by 1,125
20 more
- 2019Graph Neural Networks for Social Recommendationcited by 711
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
- 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 540
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 443
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 260
- 2020Spatial-Temporal Fusion Graph Neural Networks for Traffic Flow Forecastingcited by 212
- 2022Graph neural networks for materials science and chemistrycited by 181
- 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 141
- 2022ROLAND: Graph Learning Framework for Dynamic Graphscited by 131
- 2020A Unified View on Graph Neural Networks as Graph Signal Denoisingcited by 110
- 2019Variational Graph Recurrent Neural Networkscited by 86
- 2020APAN: Asynchronous Propagation Attention Network for Real-time Temporal Graph Embeddingcited by 78
- 2021Discrete-time Temporal Network Embedding via Implicit Hierarchical Learning in Hyperbolic Spacecited by 67
- 2021DistGNN: Scalable Distributed Training for Large-Scale Graph Neural Networkscited by 59
- 2019Temporal Network Embedding with Micro- and Macro-dynamicscited by 51
- 2022TREND: TempoRal Event and Node Dynamics for Graph Representation Learningcited by 50
- 2022DyTed: Disentangled Representation Learning for Discrete-time Dynamic Graphcited by 21
- 2021Efficient Scaling of Dynamic Graph Neural Networkscited by 11
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.