REVIEW 2 cited by
Representation Learning for Dynamic Graphs: A Survey
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
Signed reviews
read the original abstract
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static graphs. However, many applications involve evolving graphs. This introduces important challenges for learning and inference since nodes, attributes, and edges change over time. In this survey, we review the recent advances in representation learning for dynamic graphs, including dynamic knowledge graphs. We describe existing models from an encoder-decoder perspective, categorize these encoders and decoders based on the techniques they employ, and analyze the approaches in each category. We also review several prominent applications and widely used datasets and highlight directions for future research.
Forward citations
Cited by 2 Pith papers
-
A Stage-Aware Mixture of Experts Framework for Neurodegenerative Disease Progression Modelling
A hybrid physics-plus-neural model predicts tau PET progression better than baselines, with fitted stage weights suggesting graph spread is early and unspecified local processes are late.
-
Neural Dynamics on Complex Networks
A graph neural network integrated over continuous time learns the differential equations governing networked systems and predicts their future states, outperforming several temporal-graph baselines on simulated dynamics.
Discussion (0). Continue with ORCID to comment.