Methods › Graphs › Graph Models › RE-NET

Recurrent Event Network

RE-NET

2 papers tagged archive 2025-07-28

Introduced by Woojeong Jin et al. in Recurrent Event Network: Autoregressive Structure Inference over Temporal Knowledge Graphs

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Recurrent Event Network (RE-NET) is an autoregressive architecture for predicting future interactions. The occurrence of a fact (event) is modeled as a probability distribution conditioned on temporal sequences of past knowledge graphs. RE-NET employs a recurrent event encoder to encode past facts and uses a neighborhood aggregator to model the connection of facts at the same timestamp. Future facts can then be inferred in a sequential manner based on the two modules.

PaperSource

Papers archive 2025-07-28

2 shown of 2, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

3 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Knowledge Graphs2
Link Prediction2
Temporal Sequences2

Usage over time archive 2025-07-28

Papers per year tagged with RE-NET: 2019 to 2020, peak 1 1 0 2019: 1 paper 2019 2020: 1 paper 2020
Papers per year the archive tags with this method, by the paper's archive date (2 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections