Pith. sign in

REVIEW 1 cited by

Graph Hawkes Neural Network for Forecasting on Temporal Knowledge Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.13432 v3 pith:LJQJLQMF submitted 2020-03-30 cs.LG stat.ML

Graph Hawkes Neural Network for Forecasting on Temporal Knowledge Graphs

classification cs.LG stat.ML
keywords eventgraphhawkesprocesssequencestemporaltypesapproach
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The Hawkes process has become a standard method for modeling self-exciting event sequences with different event types. A recent work has generalized the Hawkes process to a neurally self-modulating multivariate point process, which enables the capturing of more complex and realistic impacts of past events on future events. However, this approach is limited by the number of possible event types, making it impossible to model the dynamics of evolving graph sequences, where each possible link between two nodes can be considered as an event type. The number of event types increases even further when links are directional and labeled. To address this issue, we propose the Graph Hawkes Neural Network that can capture the dynamics of evolving graph sequences and can predict the occurrence of a fact in a future time instance. Extensive experiments on large-scale temporal multi-relational databases, such as temporal knowledge graphs, demonstrate the effectiveness of our approach.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. GTIN: A Unified Framework for Joint Event and Time Prediction in Temporal Graphs

    cs.SI 2026-07 conditional novelty 4.0

    An edge-centric message-passing model jointly scores next-event location, Gaussian time, and features from a global temporal graph embedding and beats listed baselines on time RMSE.