mlsanityData to 7 Oct 2026

Parameter-free Dynamic Graph Embedding for Link Prediction

arXiv 2210.08189 ↗First posted 15 Oct 2022cs.LG cs.AI cs.IRcited by 12

Not on the map. Why?

Abstract (arXiv)

Dynamic interaction graphs have been widely adopted to model the evolution of user-item interactions over time. There are two crucial factors when modelling user preferences for link prediction in dynamic interaction graphs: 1) collaborative relationship among users and 2) user personalized interaction patterns. Existing methods often implicitly consider these two factors together, which may lead to noisy user modelling when the two factors diverge. In addition, they usually require time-consuming parameter learning with back-propagation, which is prohibitive for real-time user preference modelling. To this end, this paper proposes FreeGEM, a parameter-free dynamic graph embedding method for link prediction. Firstly, to take advantage of the collaborative relationships, we propose an incremental graph embedding engine to obtain user/item embeddings, which is an Online-Monitor-Offline architecture consisting of an Online module to approximately embed users/items over time, a Monitor module to estimate the approximation error in real time and an Offline module to calibrate the user/item embeddings when the online approximation errors exceed a threshold. Meanwhile, we integrate attribute information into the model, which enables FreeGEM to better model users belonging to some under represented groups. Secondly, we design a personalized dynamic interaction pattern modeller, which combines dynamic time decay with attention mechanism to model user short-term interests. Experimental results on two link prediction tasks show that FreeGEM can outperform the state-of-the-art methods in accuracy while achieving over 36X improvement in efficiency. All code and datasets can be found in https://github.com/FudanCISL/FreeGEM.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 21 of its 47 references that are in the map. First posted on arXiv 15 Oct 2022.

Builds on

21 of 47 references.

References · 21

  1. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  2. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
  3. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
  4. 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 260
  5. 2019Representation Learning for Dynamic Graphs: A Surveycited by 260
  6. 2017Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphscited by 149
  7. 2019Intensity-Free Learning of Temporal Point Processescited by 138
  8. 2021TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learningcited by 65
  9. 2022TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphscited by 59
  10. 2021How Powerful is Graph Convolution for Recommendation?cited by 50
  11. 2022TREND: TempoRal Event and Node Dynamics for Graph Representation Learningcited by 50
  12. 2016Deep Coevolutionary Network: Embedding User and Item Features for Recommendationcited by 33
9 more
  1. 2021Dynamic Graph Collaborative Filteringcited by 33
  2. 2020Graph Convolutional Network for Recommendation with Low-pass Collaborative Filterscited by 32
  3. 2017TIMERS: Error-Bounded SVD Restart on Dynamic Networkscited by 19
  4. 2020Knowledge Transfer via Pre-training for Recommendation: A Review and Prospectcited by 11
  5. 2019Markov Random Fields for Collaborative Filteringcited by 8
  6. 2021Deep Structural Point Process for Learning Temporal Interaction Networkscited by 8
  7. 2020Dynamic Embeddings for Interaction Predictioncited by 6
  8. 2021Exploring and Mitigating Gender Bias in Recommender Systems with Explicit Feedbackcited by 4
  9. 2021Multi-Relation Aware Temporal Interaction Network Embeddingcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 4; 2024: 3; 2025: 2; 2026: 2.

12 papers.