Temporal Knowledge Graph Embedding based on Multivariate Gaussian Process
Recently, reasoning over Temporal Knowledge Graph (TKG), such as link prediction, has become an attractive research topic. Numerous Temporal Knowledge Graph Embedding (TKGE) methods have been proposed to map the entities and relations in TKG to the high-dimensional representations for further reasoning tasks. However, most existing TKGE methods \lh{which mainly based on deterministic vector embeddings, still} have two drawbacks. On the one hand, they mainly model temporal evolution of entities and relations by a deterministic function of time, which captures the global trends but fails at the surging local fluctuations. On the other hand, they mainly focus on the semantic meaning of embeddings, while losing the sight of temporal uncertainties of the embeddings. To tackle such limitations, in this paper, we propose a novel approach to mapping the entities and relations in TKG to multivariate Gaussian Processes (MGP). With the flexibility and capacity of MGP, the global trends as well as the local fluctuations can be simultaneously modeled. Moreover, the temporal uncertainties can be also captured with the kernel function and covariance matrix of MGP. Experimental results show the effectiveness of the proposed approach on two real-world benchmark datasets compared with some state-of-the-art TKGE methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Gaussian ProcessesGraph EmbeddingKnowledge Graph EmbeddingLink PredictionSimilar Papers 제목 키워드 기반
Temporal Knowledge Graph Completion with Approximated Gaussian Process Embedding
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…
Gaussian ProcessesKnowledge Graph CompletionKnowledge GraphsLink Prediction+2DynG2G: An Efficient Stochastic Graph Embedding Method for Temporal Graphs
Dynamic graph embedding has gained great attention recently due to its capability of learning low dimensional graph representations for complex temporal graphs with high accuracy. However, recent advances mostly focus on…
DiversityDynamic graph embeddingGraph EmbeddingTriplet+1Temporal Knowledge Graph Embedding Model based on Additive Time Series Decomposition
Knowledge Graph (KG) embedding has attracted more attention in recent years. Most KG embedding models learn from time-unaware triples. However, the inclusion of temporal information beside triples would further improve t…
Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingLink Prediction+4Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphs
The availability of large scale event data with time stamps has given rise to dynamically evolving knowledge graphs that contain temporal information for each edge. Reasoning over time in such dynamic knowledge graphs is…
Entity EmbeddingsKnowledge GraphsRelational ReasoningTransformerG2G: Adaptive time-stepping for learning temporal graph embeddings using transformers
Dynamic graph embedding has emerged as a very effective technique for addressing diverse temporal graph analytic tasks (i.e., link prediction, node classification, recommender systems, anomaly detection, and graph genera…
Anomaly DetectionComputational EfficiencyDynamic graph embeddingGraph Embedding+5