Attention-Based Relation Prediction of Knowledge Graph by Incorporating Graph and Context Features

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As the vital resource for various applications like question answering and recommendation system, knowledge graph (KG) often suffers from incompleteness. The task of relation prediction in KG aims to infer the relations between entities, which depend on the structure of the query-specific subgraph but also the neighborhood as context. In this paper, we propose an attention-based joint model for relation prediction by incorporating the graph and context features of entities and relations. First, we extract the subgraph and entity context from KG, and adopt the attention mechanism to capture the most relevant graph and context features, which we leverage to generate the enhanced representations. Then, we give the joint loss function to guarantee the unified representation including the relevant graph and context features simultaneously. Finally, we fulfill model training for relation prediction. Experimental results on real-world datasets demonstrate that our proposed approach outperforms the state-of-the-art competitors.

Cite

CITATION STYLE

APA

Zhong, S., Yue, K., & Duan, L. (2022). Attention-Based Relation Prediction of Knowledge Graph by Incorporating Graph and Context Features. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13724 LNCS, pp. 259–273). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-20891-1_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free