Dynamic Graph Link Prediction by Integrating Historical Recurrence Signals and Time-Weighted Similarity Matching
Main Article Content
Keywords
dynamic graphs, future link prediction, repeated interactions, candidate-aware matching, mean reciprocal rank (MRR)
Abstract
Future link prediction on dynamic graphs must rank both recurring interactions and links between previously unconnected nodes. We extend the CRAFT-R candidate-aware cross-attention matcher with explicit historical recurrence statistics, time-weighted embedding similarity, and candidate-specific residual fusion. Under chronological splits and fixed 100-candidate queries on three competition datasets, we evaluate four retrained configurations alongside history-based ranking rules. The full model achieves test mean reciprocal ranks (MRRs) of 0.845, 0.296, and 0.576 on dataset1, dataset2, and dataset3, respectively, exceeding the backbone control by 0.033, 0.026, and 0.033. Removing the statistics branch reduces MRR by 0.020, 0.007, and 0.004; removing the similarity branch reduces it by 0.012, 0.021, and 0.012. Separate strict-past analyses show that direct recurrence is sensitive to historical coverage and to whether recent events remain visible at prediction time. The auxiliary signals therefore contribute differently across datasets, while the value of a longer or rolling history depends on the available evidence. The full model also leads seven evaluated baselines on AP, AUC, and MRR across the three datasets under the reported protocol.
References
- [1]Yi L, Lei R, Mo F, et al. Future Link Prediction Without Memory or Aggregation. Advances in Neural Information Processing Systems. 2025; 38.
- [2]Kumar S, Zhang X, Leskovec J. Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2019: 1269–1278.
- [3]Rossi E, Chamberlain B, Frasca F, et al. Temporal Graph Networks for Deep Learning on Dynamic Graphs. In: ICML Workshop on Graph Representation Learning and Beyond. 2020.
- [4]Xu D, Ruan C, Korpeoglu E, et al. Inductive Representation Learning on Temporal Graphs. In: International Conference on Learning Representations. 2020.
- [5]Wang Y, Chang Y Y, Liu Y, et al. Inductive Representation Learning in Temporal Networks via Causal Anonymous Walks. In: International Conference on Learning Representations. 2021.
- [6]Cong W, Zhang S, Kang J, et al. Do We Really Need Complicated Model Architectures for Temporal Networks? In: International Conference on Learning Representations. 2023.
- [7]Yu L, Sun L, Du B, et al. Towards Better Dynamic Graph Learning: New Architecture and Unified Library. Advances in Neural Information Processing Systems. 2023; 36: 67686–67700.
- [8]Hidasi B, Karatzoglou A, Baltrunas L, et al. Session-Based Recommendations with Recurrent Neural Networks. In: International Conference on Learning Representations. 2016.
- [9]Kang W C, McAuley J. Self-Attentive Sequential Recommendation. In: Proceedings of the IEEE International Conference on Data Mining. 2018: 197–206.
- [10]Vaswani A, Shazeer N, Parmar N, et al. Attention Is All You Need. Advances in Neural Information Processing Systems. 2017; 30: 5998–6008.
- [11]Ren P, Chen Z, Li J, et al. RepeatNet: A Repeat Aware Neural Recommendation Machine for Session-Based Recommendation. Proceedings of the AAAI Conference on Artificial Intelligence. 2019; 33(1): 4806–4813.
- [12]Poursafaei F, Huang S, Pelrine K, et al. Towards Better Evaluation for Dynamic Link Prediction. Advances in Neural Information Processing Systems. 2022; 35: 32928–32941.
- [13]He X, Deng K, Wang X, et al. LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 2020: 639–648.
- [14]Rendle S, Freudenthaler C, Gantner Z, et al. BPR: Bayesian Personalized Ranking from Implicit Feedback. In: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence. Proceedings of Machine Learning Research. 2009; R7: 460–469.
- [15]Lin T Y, Goyal P, Girshick R, et al. Focal Loss for Dense Object Detection. In: Proceedings of the IEEE International Conference on Computer Vision. 2017: 2980–2988.
- [16]Huang S, Poursafaei F, Danovitch J, et al. Temporal Graph Benchmark for Machine Learning on Temporal Graphs. Advances in Neural Information Processing Systems. 2023; 36.
- [17]Yi L, Peng J, Zheng Y, et al. TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics. In: International Conference on Learning Representations. 2025.
- [18]Krichene W, Rendle S. On Sampled Metrics for Item Recommendation. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2020: 1748–1757.
- [19]Srivastava N, Hinton G, Krizhevsky A, et al. Dropout: A Simple Way to Prevent Neural Networks from Overfitting. Journal of Machine Learning Research. 2014; 15(56): 1929–1958.
- [20]Kingma D P, Ba J. Adam: A Method for Stochastic Optimization. In: International Conference on Learning Representations. 2015.
