The DOI matches its Crossref record; 39 of the 43 references it cites were found in a registry or an index.
TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion
Open accessAbstract
Inferring missing facts in temporal knowledge graphs (TKGs) is a fundamental and challenging task.Previous works have approached this problem by augmenting methods for static knowledge graphs to leverage time-dependent representations.However, these methods do not explicitly leverage multi-hop structural information and temporal facts from recent time steps to enhance their predictions.Additionally, prior work does not explicitly address the temporal sparsity and variability of entity distributions in TKGs.We propose the Temporal Message Passing (TeMP) framework to address these challenges by combining graph neural networks, temporal dynamics models, data imputation and frequency-based gating techniques.Experiments 1 on standard TKG tasks show that our approach provides substantial gains compared to the previous state of the art, achieving a 10.7% average relative improvement in Hits@10 across three standard benchmarks.Our analysis also reveals important sources of variability both within and across TKG datasets, and we introduce several simple but strong baselines that outperform the prior state of the art in certain settings.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This graph format is closely related to the group of temporal KGs and recent temporal KG-based anomalydetection efforts provide powerful tools to model and detect changes in these time-varying relational data [31], [32], [33].”
From Toward Context-Aware Anomaly Detection for AIOps in Microservices Using Dynamic Knowledge Graphs (2026) · cites this paper as [32]
Citations
Cites
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404
Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation
Cho, K., van Merrienboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., & Bengio, Y. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1179 · Cited by 25,545
(2013) · Cited by 5,726
Modeling Relational Data with Graph Convolutional Networks
Schlichtkrull, M., Kipf, T. N., Bloem, P., van den Berg, R., Titov, I., & Welling, M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93417-4_38 · Cited by 5,570
Recurrent Neural Networks for Multivariate Time Series with Missing Values
Che, Z., Purushotham, S., Cho, K., Sontag, D., & Liu, Y. (2018) · Scientific Reports · doi:10.1038/s41598-018-24271-9 · Cited by 2,370
Embedding Entities and Relations for Learning and Inference in Knowledge Bases
Yang, B., Yih, W.-T., He, X., Gao, J., & Deng, L. (2014) · arXiv · doi:10.48550/arxiv.1412.6575 · Cited by 2,252
Representation Learning on Graphs: Methods and ApplicationsPreprint
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · IEEE Data Engineering Bulletin · doi:10.48550/arxiv.1709.05584 · Cited by 2,203
Self-citationComplex Embeddings for Simple Link Prediction
Trouillon, T., Welbl, J., Riedel, S., Gaussier, É., & Bouchard, G. (2016) · arXiv · doi:10.48550/arxiv.1606.06357 · Cited by 2,100
A Three-Way Model for Collective Learning on Multi-Relational Data
Nickel, M., Tresp, V., & Kriegel, H. (2011) · Cited by 1,806
DropEdge: Towards Deep Graph Convolutional Networks on Node ClassificationPreprint
Rong, Y., Huang, W., Xu, T., & Huang, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.10903 · Cited by 1,124
Cited by
Sorted by citations
A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal
Liang, K., Meng, L., Liu, M., Liu, Y., Tu, W., Wang, S., Zhou, S., Liu, X., Sun, F., & He, K. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3417451 · Cited by 438
Foundations and Modeling of Dynamic Networks Using Dynamic Graph Neural Networks: A Survey
Skarding, J., Gabryś, B., & Musiał, K. (2021) · IEEE Access · doi:10.1109/access.2021.3082932 · Cited by 382
Graph Neural Networks for Natural Language Processing: A Survey
Wu, L., Chen, Y., Shen, K., Guo, X., Gao, H., Li, S., Pei, J., & Long, B. (2023) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000096 · Cited by 417
A Survey on Knowledge Graph Embeddings for Link Prediction
Wang, M., Qiu, L., & Wang, X. (2021) · Symmetry · doi:10.3390/sym13030485 · Cited by 212
TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting
Sun, H., Zhong, J., Ma, Y., Han, Z., & He, K. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.655 · Cited by 238
Metadata
- Authors
- Wu, J., Cao, M., Cheung, J. C. K., & Hamilton, W. L.
- Affiliations
- Mila - Quebec Artificial Intelligence Institute (CA)
- Venue
- Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP)
- Published
- 2020
- Pages
- 5730-5746
- OpenAlex
- W3099845049
- Cited by
- 167
- References
- 43
- Citations by year
- 2026: 23 · 2025: 31 · 2024: 39 · 2023: 39 · 2022: 24 · 2021: 11
- FWCI
- 7.07
- Type
- conference paper
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- Locations
- Conference on Empirical Methods in Natural Language Processing (EMNLP) (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Canadian Institute for Advanced Research
- Compute Canada
- Samsung
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Keywords
- temporal knowledge graphs, knowledge graph completion, graph neural networks, missing data imputation, temporal sparsity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review