Skip to main navigation Skip to search Skip to main content

Probabilistic Continuous-Time Whole-Graph Forecasting

  • Xingjian Shi
  • , Yuyang Wang
  • , Hao Wang
  • , Zhihan Gao*
  • , Dit Yan Yeung
  • *Corresponding author for this work

Research output: Contribution to conferenceConference Paperpeer-review

Abstract

Dynamic graph forecasting has found a wide range of applications including social media, recommendation systems, and computational finance. However, existing dynamic graph models typically focus on discrete-time dynamic graphs, treating dynamic graphs as temporally discrete graph snapshots. We argue that such discrete treatment is inadequate for capturing the underlying dynamics which are intrinsically continuous. To overcome such deficiency, we extend fully connected neural ordinary differential equations (FCNODE) to graph-connected neural ordinary differential equations (GNODE), which considers graph structures in the input space, output space, and the transition in the latent space. Experiments show that our GNODE naturally captures the continuous-time dynamics in graph sequences and consistently outperforms state-of-the-art graph forecasting methods.
Original languageEnglish
Publication statusPublished - Aug 2022
EventKDD Workshop on Mining and Learning from Time Series 2022 -
Duration: 1 Aug 20221 Aug 2022

Conference

ConferenceKDD Workshop on Mining and Learning from Time Series 2022
Period1/08/221/08/22

Fingerprint

Dive into the research topics of 'Probabilistic Continuous-Time Whole-Graph Forecasting'. Together they form a unique fingerprint.

Cite this