THOR: Self-Supervised Temporal Knowledge Graph Embedding via Three-Tower Graph Convolutional Networks
- Authors
- Lee, Yeon-Chang; Lee, Jaehyun; Lee, Dongwon; Kim, Sang-Wook
- Issue Date
- Nov-2022
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- graph embedding; temporal knowledge graph
- Citation
- Proceedings - IEEE International Conference on Data Mining, ICDM, v.2022-November, pp.1035 - 1040
- Indexed
- SCOPUS
- Journal Title
- Proceedings - IEEE International Conference on Data Mining, ICDM
- Volume
- 2022-November
- Start Page
- 1035
- End Page
- 1040
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/182520
- DOI
- 10.1109/ICDM54844.2022.00127
- ISSN
- 1550-4786
- Abstract
- The goal of temporal knowledge graph embedding (TKGE) is to represent the entities and relations in a given temporal knowledge graph (TKG) as low-dimensional vectors (i.e., embeddings), which preserve both semantic information and temporal dynamics of the factual information. In this paper, we posit that the intrinsic difficulty of existing TKGE methods lies in the lack of information in KG snapshots with timestamps, each of which contains the facts that co-occur at a specific timestamp. To address this challenge, we propose a novel self-supervised TKGE approach, THOR (Three-tower grapH cOnvolution netwoRks (GCNs)), which extracts latent knowledge from TKGs by jointly leveraging both temporal and atemporal dependencies between entities and the structural dependency between relations. THOR learns the embeddings of entities and relations Our experiments on three real-world datasets demonstrate that THOR significantly outperforms 13 competitors in terms of TKG completion tasks. The codebase of THOR is available at https://github.com/EJHyun/THOR.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/182520)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.