Dynamical Graph Echo State Networks with Snapshot Merging for Dissemination Process Classification

07/03/2023
by   Ziqiang Li, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2013

DNA Reservoir Computing: A Novel Molecular Computing Approach

We propose a novel molecular computing approach based on reservoir compu...
research
10/16/2021

Dynamic Graph Echo State Networks

Dynamic temporal graphs represent evolving relations between entities, e...
research
09/05/2020

Space efficient merging of de Bruijn graphs and Wheeler graphs

The merging of succinct data structures is a well established technique ...
research
08/04/2017

A criterion for bubble merging in liquid metal: computational and experimental study

An innovative model is presented for merging of bubbles inside a liquid ...
research
10/28/2020

Graph embedding using multi-layer adjacent point merging model

For graph classification tasks, many traditional kernel methods focus on...
research
02/07/2019

Space-efficient merging of succinct de Bruijn graphs

We propose a new algorithm for merging succinct representations of de Br...
research
10/27/2022

Beyond Homophily with Graph Echo State Networks

Graph Echo State Networks (GESN) have already demonstrated their efficac...

Please sign up or login with your details

Forgot password? Click here to reset