Learning Across Temporal Graph Representation Silos
Organizations: M. Yu and Y.-g. Ha are with Smart Computing Laboratory, Department of Computer Science & Engineering, Konkuk University, Seoul 05029, Republic of Korea.
Abstract
Temporal graph data are recorded in different representations, but whether these differences also determine the scope of learned knowledge reuse remains unclear. This study investigates whether predictive structure learned from relational histories can be reused between continuous-time dynamic graphs (CTDGs) and temporal knowledge graphs (TKGs). Bidirectional reuse emerges while retaining distinct input and prediction interfaces and independent vocabularies, and sources with the same representation are not always more useful. Controlled reorganizations of source histories show that the organization contributing to reuse varies across source-target conditions. We show that learned aspects of Relational Dynamics, the predictive structure present in relational histories, can be reused across conventional representation boundaries. Independently pretrained TKG and CTDG learners can also be fused at the score level to improve prediction on a third dataset without entity or relation-semantic alignment. Two proofs of concept in recommendation and security detection illustrate that external temporal sources without direct alignment can also become useful pretraining resources.
Figures & tables
| Setting | CTDG | TKG |
| Dataset | Wikipedia, Reddit, MOOC | ICEWS14, GDELT, ICEWS05-15 |
| Task / metrics | Link prediction; AP, AUC | Head/tail forecasting; filtered MRR, Hits@1/3/10 |
| Checkpoint selection | Full-validation AP | 100-negative MRR; full validation (256 queries for the DyGFormer Wiki ICEWS14 diagnostic) |
| Test evaluation | 1 random destination per positive | Bidirectional queries all entities; timestamp filtering |
| Direction | Metric | Frozen backbone | Seed 7 | Seed 17 | Seed 37 | Mean SD | Mean |
| Wiki ICEWS14 | Test MRR | Random | 0.1225 | 0.1177 | 0.1092 | — | |
| Wiki ICEWS14 | Test MRR | Source-pretrained | 0.2168 | 0.1894 | 0.2115 | ||
| ICEWS14 Wiki | Test AP | Random | 0.8414 | 0.8264 | 0.8713 | — | |
| ICEWS14 Wiki | Test AP | Source-pretrained |
Dynamic Graph Learning
Dynamic graph learning models how networks and their node features change over time to predict links, events, labels, and system behavior.
See all 121 papers