Knowledge Graph Embedding with Direct and Disentangled Neighborhood Representation Attention Network

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

Abstract

Knowledge Graph Completion (KGC) has become a focus of attention across the deep learning community owing to its excellent contribution to numerous downstream tasks. Despite the recent surge in KGC work, most existing KGC models deal with triples in Knowledge Graphs (KGs) independently, ignoring the inherent and valuable information from the neighborhoods around entities and the dynamic properties of entities in different link prediction tasks. We propose a novel Direct and Disentangled Neighborhood Representation Attention Network (DDNAN) for KGC, with an adaptive selector to decide what kind of neighborhood information should be aggregated to the current entity. With the assistance of the relation-aware attention aggregator, our model can exploit Knowledge Graphs (KGs) to generate dynamic representations of the given different scenarios and prediction tasks. Extensive experiments on public benchmark datasets have been conducted to validate the superiority of DDNAN over existing methods in terms of both accuracy and interpretability. The code is available at https://github.com/Ariel-Gao/DDNAN.

Cite

CITATION STYLE

APA

Yu, R., Gao, S., Yu, J., Zhao, M., Xu, T., Gao, J., … Li, X. (2022). Knowledge Graph Embedding with Direct and Disentangled Neighborhood Representation Attention Network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13368 LNAI, pp. 281–294). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-10983-6_22

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