THOR: Self-Supervised Temporal Knowledge Graph Embedding via Three-Tower Graph Convolutional Networks

Citations

WEB OF SCIENCE

14
Citations

SCOPUS

20

초록

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.

키워드

graph embedding; temporal knowledge graph; Convolution; Graph embeddings; Knowledge management; Semantics; Knowledge graph; Convolutional networks; Dimensional vectors; Embeddings; Graph embeddings; Knowledge graphs; Low dimensional; Temporal knowledge; Temporal knowledge graph; Time-stamp; Tower graph
제목
THOR: Self-Supervised Temporal Knowledge Graph Embedding via Three-Tower Graph Convolutional Networks
저자
Lee, Yeon-Chang; Lee, Jaehyun; Lee, Dongwon; Kim, Sang-Wook
DOI
10.1109/ICDM54844.2022.00127
발행일
2022-11
유형
Proceedings Paper
저널명
2022 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM)
권
2022-November
페이지
1035 ~ 1040