Dynamic Link Prediction for New Nodes in Temporal Graph Networks
Not on the map. Why?
Abstract (arXiv)
Modelling temporal networks for dynamic link prediction of new nodes has many real-world applications, such as providing relevant item recommendations to new customers in recommender systems and suggesting appropriate posts to new users on social platforms. Unlike old nodes, new nodes have few historical links, which poses a challenge for the dynamic link prediction task. Most existing dynamic models treat all nodes equally and are not specialized for new nodes, resulting in suboptimal performances. In this paper, we consider dynamic link prediction of new nodes as a few-shot problem and propose a novel model based on the meta-learning principle to effectively mitigate this problem. Specifically, we develop a temporal encoder with a node-level span memory to obtain a new node embedding, and then we use a predictor to determine whether the new node generates a link. To overcome the few-shot challenge, we incorporate the encoder-predictor into the meta-learning paradigm, which can learn two types of implicit information during the formation of the temporal network through span adaptation and node adaptation. The acquired implicit information can serve as model initialisation and facilitate rapid adaptation to new nodes through a fine-tuning process on just a few links. Experiments on three publicly available datasets demonstrate the superior performance of our model compared to existing state-of-the-art methods.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 25 of its 37 references that are in the map. First posted on arXiv 15 Oct 2023.
Builds on
25 of 37 references.
References · 25
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2020Meta-Learning in Neural Networks: A Surveycited by 944
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
- 2020Inductive Representation Learning on Temporal Graphscited by 454
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 443
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
- 2016Learning Convolutional Neural Networks for Graphscited by 314
- 2016Structured Sequence Modeling with Graph Convolutional Recurrent Networkscited by 273
13 more
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 260
- 2018Meta-Learning: A Surveycited by 254
- 2021Inductive Representation Learning in Temporal Networks via Causal Anonymous Walkscited by 188
- 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Librarycited by 154
- 2019Meta-GNN: On Few-shot Node Classification in Graph Meta-learningcited by 105
- 2020Graph Meta Learning via Local Subgraphscited by 89
- 2021TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learningcited by 65
- 2019Graph Few-shot Learning via Knowledge Transfercited by 63
- 2019Temporal Network Embedding with Micro- and Macro-dynamicscited by 51
- 2020Meta-learning in natural and artificial intelligencecited by 39
- 2020Few-Shot Learning on Graphs via Super-Classes based on Graph Spectral Measurescited by 31
- 2019Meta-Graph: Few Shot Link Prediction via Meta Learningcited by 24
- 2022Encoder-Decoder Architecture for Supervised Dynamic Graph Learning: A Surveycited by 14
Built on by
Citing papers per year: 2024: 1.
1 paper.