Cited by 82

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Learning to Walk across Time for Interpretable Temporal Knowledge Graph Completion

Jung, Jaehun, Jung, Jinhong, Kang, U·2021·Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining

Abstract

Static knowledge graphs (KGs), despite their wide usage in relational reasoning and downstream tasks, fall short of realistic modeling of knowledge and facts that are only temporarily valid. Compared to static knowledge graphs, temporal knowledge graphs (TKGs) inherently reflect the transient nature of real-world knowledge. Naturally, automatic TKG completion has drawn much research interests for a more realistic modeling of relational reasoning. However, most of the existing models for TKG completion extend static KG embeddings that do not fully exploit TKG structure, thus lacking in 1) accounting for temporally relevant events already residing in the local neighborhood of a query, and 2) path-based inference that facilitates multi-hop reasoning and better interpretability. In this paper, we propose T-GAP, a novel model for TKG completion that maximally utilizes both temporal information and graph structure in its encoder and decoder. T-GAP encodes query-specific substructure of TKG by focusing on the temporal displacement between each event and the query timestamp, and performs path-based inference by propagating attention through the graph. Our empirical experiments demonstrate that T-GAP not only achieves superior performance against state-of-the-art baselines, but also competently generalizes to queries with unseen timestamps. Through extensive qualitative analyses, we also show that T-GAP enjoys transparent interpretability, and follows human intuition in its reasoning…

Overview

Integrity signals

Registry

Crossref · 10.1145/3447548.3467292

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 3 references

Research works printed but not linked: 23

  1. Antoine Bordes Nicolas Usunier Alberto Garcia-Duran Jason Weston and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In Advances in neural information processing systems. 2787--2795. Antoine Bordes Nicolas Usunier Alberto Garcia-Duran Jason Weston and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In Advances in neural information processing systems. 2787--2795.
  2. Jianlong Chang Jie Gu Lingfeng Wang Gaofeng Meng Shiming Xiang and Chunhong Pan. 2018. Structure-aware convolutional neural networks. In Advances in neural information processing systems. 11--20. Jianlong Chang Jie Gu Lingfeng Wang Gaofeng Meng Shiming Xiang and Chunhong Pan. 2018. Structure-aware convolutional neural networks. In Advances in neural information processing systems. 11--20.
  3. Rajarshi Das , Shehzaad Dhuliawala , Manzil Zaheer , Luke Vilnis , Ishan Durugkar , Akshay Krishnamurthy , Alex Smola , and Andrew McCallum . 2018 . Go for a Walk and Arrive at the Answer: Reasoning Over Paths in Knowledge Bases using Reinforcement Learning . In International Conference on Learning Representations. Rajarshi Das, Shehzaad Dhuliawala, Manzil Zaheer, Luke Vilnis, Ishan Durugkar, Akshay Krishnamurthy, Alex Smola, and Andrew McCallum. 2018. Go for a Walk and Arrive at the Answer: Reasoning Over Paths in Knowledge Bases using Reinforcement Learning. In International Conference on Learning Representations.
  4. 10.18653/v1/D18-1225 · DOI · Paper page
  5. 10.1609/aaai.v32i1.11573 · DOI · Paper page
  6. 10.18653/v1/D18-1516 · DOI · Paper page
  7. Rishab Goel , Seyed Mehran Kazemi , Marcus Brubaker, and Pascal Poupart. 2019 . Diachronic embedding for temporal knowledge graph completion. arXiv preprint arXiv:1907.03143 (2019). Rishab Goel, Seyed Mehran Kazemi, Marcus Brubaker, and Pascal Poupart. 2019. Diachronic embedding for temporal knowledge graph completion. arXiv preprint arXiv:1907.03143 (2019). · arXiv
  8. Ziniu Hu , Yuxiao Dong , Kuansan Wang , and Yizhou Sun . 2020. Heterogeneous Graph Transformer . Association for Computing Machinery , New York, NY, USA , 2704--2710. https://doi.org/10.1145/3366423.3380027 10.1145/3366423.3380027 Ziniu Hu, Yuxiao Dong, Kuansan Wang, and Yizhou Sun. 2020. Heterogeneous Graph Transformer. Association for Computing Machinery, New York, NY, USA, 2704--2710. https://doi.org/10.1145/3366423.3380027 · DOI · Paper page
  9. 10.1007/s00778-016-0427-4 · DOI
  10. Tingsong Jiang , Tianyu Liu , Tao Ge , Lei Sha , Baobao Chang , Sujian Li , and Zhifang Sui . 2016 . Towards time-aware knowledge graph completion . In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers. 1715--1724 . Tingsong Jiang, Tianyu Liu, Tao Ge, Lei Sha, Baobao Chang, Sujian Li, and Zhifang Sui. 2016. Towards time-aware knowledge graph completion. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers. 1715--1724.
  11. Timothée Lacroix , Guillaume Obozinski , and Nicolas Usunier . 2019 . Tensor Decompositions for Temporal Knowledge Base Completion. In International Conference on Learning Representations. Timothée Lacroix, Guillaume Obozinski, and Nicolas Usunier. 2019. Tensor Decompositions for Temporal Knowledge Base Completion. In International Conference on Learning Representations.
  12. 10.18653/v1/D18-1362 · DOI
  13. 10.18653/v1/P18-1223 · DOI
  14. 10.1016/j.websem.2018.12.008 · DOI
  15. 10.18653/v1/P19-1466 · DOI
  16. Aldo Pareja , Giacomo Domeniconi , Jie Chen , Tengfei Ma , Toyotaro Suzumura , Hiroki Kanezashi , Tim Kaler , Tao B. Schardl , and Charles E. Leiserson . 2020. EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs . In Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence. Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, Tao B. Schardl, and Charles E. Leiserson. 2020. EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. In Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence.
  17. Petar Velivc ković, Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Lio , and Yoshua Bengio . 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 ( 2017 ). Petar Velivc ković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017). · arXiv
  18. 10.1609/aaai.v33i01.33015329 · DOI · Paper page
  19. Xiaoran Xu , Wei Feng , Yunsheng Jiang , Xiaohui Xie , Zhiqing Sun , and Zhi-Hong Deng . 2019 . Dynamically Pruned Message Passing Networks for Large-scale Knowledge Graph Reasoning. In International Conference on Learning Representations. Xiaoran Xu, Wei Feng, Yunsheng Jiang, Xiaohui Xie, Zhiqing Sun, and Zhi-Hong Deng. 2019. Dynamically Pruned Message Passing Networks for Large-scale Knowledge Graph Reasoning. In International Conference on Learning Representations.
  20. Xiaoran Xu , Songpeng Zu , Chengliang Gao , Yuan Zhang , and Wei Feng . 2018. Modeling Attention Flow on Graphs. arXiv preprint arXiv:1811.00497 ( 2018 ). Xiaoran Xu, Songpeng Zu, Chengliang Gao, Yuan Zhang, and Wei Feng. 2018. Modeling Attention Flow on Graphs. arXiv preprint arXiv:1811.00497 (2018). · arXiv
  21. Bishan Yang , Wen-tau Yih, Xiaodong He , Jianfeng Gao , and Li Deng . 2014. Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:1412.6575 ( 2014 ). Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, and Li Deng. 2014. Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:1412.6575 (2014). · arXiv
  22. 10.1609/aaai.v32i1.12057 · DOI
  23. Zhao Zhang Fuzhen Zhuang Hengshu Zhu Zhi-Ping Shi Hui Xiong and Qing He. 2020. Relational Graph Neural Network with Hierarchical Attention for Knowledge Graph Completion.. In AAAI. 9612--9619. Zhao Zhang Fuzhen Zhuang Hengshu Zhu Zhi-Ping Shi Hui Xiong and Qing He. 2020. Relational Graph Neural Network with Hierarchical Attention for Knowledge Graph Completion.. In AAAI. 9612--9619. · DOI

Cited by

Sorted by citations

See all 82

Metadata

Authors
Jung, J., Jung, J., & Kang, U.
Affiliations
  • Seoul National University & Kakao Enterprise, Seoul, South Korea
  • Jeonbuk National University, Jeonju, South Korea
  • Seoul National University, Seoul, South Korea
Venue
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining
Publisher
ACM
Published
2021-08-14
Pages
786-795
Cited by
82
References
3
Funders
National Research Foundation of Korea (2019R1A2C2004990)

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Learning to Walk across Time for Interpretable Temporal Knowledge Graph Completion. https://app.cochat.ai/papers/10.1145/3447548.3467292
The paper
Jung, J., Jung, J., & Kang, U. (2021). Learning to Walk across Time for Interpretable Temporal Knowledge Graph Completion. Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. https://doi.org/10.1145/3447548.3467292