Temporal Knowledge Graph Completion with Approximated Gaussian Process Embedding

Linhai Zhang, Deyu Zhou


Abstract
Knowledge Graphs (KGs) stores world knowledge that benefits various reasoning-based applications. Due to their incompleteness, a fundamental task for KGs, which is known as Knowledge Graph Completion (KGC), is to perform link prediction and infer new facts based on the known facts. Recently, link prediction on the temporal KGs becomes an active research topic. Numerous Temporal Knowledge Graph Completion (TKGC) methods have been proposed by mapping the entities and relations in TKG to the high-dimensional representations. However, most existing TKGC methods are mainly based on deterministic vector embeddings, which are not flexible and expressive enough. In this paper, we propose a novel TKGC method, TKGC-AGP, by mapping the entities and relations in TKG to the approximations of multivariate Gaussian processes (MGPs). Equipped with the flexibility and capacity of MGP, the global trends as well as the local fluctuations in the TKGs can be simultaneously modeled. Moreover, the temporal uncertainties can be also captured with the kernel function and the covariance matrix of MGP. Moreover, a first-order Markov assumption-based training algorithm is proposed to effective optimize the proposed method. Experimental results show the effectiveness of the proposed approach on two real-world benchmark datasets compared with some state-of-the-art TKGC methods.
Anthology ID:
2022.coling-1.416
Volume:
Proceedings of the 29th International Conference on Computational Linguistics
Month:
October
Year:
2022
Address:
Gyeongju, Republic of Korea
Venue:
COLING
SIG:
Publisher:
International Committee on Computational Linguistics
Note:
Pages:
4697–4706
Language:
URL:
https://aclanthology.org/2022.coling-1.416
DOI:
Bibkey:
Cite (ACL):
Linhai Zhang and Deyu Zhou. 2022. Temporal Knowledge Graph Completion with Approximated Gaussian Process Embedding. In Proceedings of the 29th International Conference on Computational Linguistics, pages 4697–4706, Gyeongju, Republic of Korea. International Committee on Computational Linguistics.
Cite (Informal):
Temporal Knowledge Graph Completion with Approximated Gaussian Process Embedding (Zhang & Zhou, COLING 2022)
Copy Citation:
PDF:
https://aclanthology.org/2022.coling-1.416.pdf
Data
ICEWSYAGO