Dynamical Graph Echo State Networks with Snapshot Merging for Dissemination Process Classification
Not on the map. Why?
Abstract (arXiv)
The Dissemination Process Classification (DPC) is a popular application of temporal graph classification. The aim of DPC is to classify different spreading patterns of information or pestilence within a community represented by discrete-time temporal graphs. Recently, a reservoir computing-based model named Dynamical Graph Echo State Network (DynGESN) has been proposed for processing temporal graphs with relatively high effectiveness and low computational costs. In this study, we propose a novel model which combines a novel data augmentation strategy called snapshot merging with the DynGESN for dealing with DPC tasks. In our model, the snapshot merging strategy is designed for forming new snapshots by merging neighboring snapshots over time, and then multiple reservoir encoders are set for capturing spatiotemporal features from merged snapshots. After those, the logistic regression is adopted for decoding the sum-pooled embeddings into the classification results. Experimental results on six benchmark DPC datasets show that our proposed model has better classification performances than the DynGESN and several kernel-based models.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 20 references that are in the map. First posted on arXiv 3 Jul 2023.
Builds on
7 of 20 references.
References · 7
- 2017Attention Is All You Needcited by 59,932
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2014On the Properties of Neural Machine Translation: Encoder-Decoder Approachescited by 1,303
- 2020Spatial-Temporal Fusion Graph Neural Networks for Traffic Flow Forecastingcited by 212
- 2015Analysis and Control of Epidemics: A survey of spreading processes on complex networkscited by 14
- 2019Temporal Graph Kernels for Classifying Dissemination Processescited by 14
- 2021Dynamic Graph Echo State Networkscited by 6
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Filtration Surfaces for Dynamic Graph Classificationcited by 1
- 2023Filtration Surfaces for Dynamic Graph Classification7 Sep 2023