Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs

Deepak Nathani, Jatin Chauhan, Charu Sharma, Manohar Kaul
6/4/2019
cs.LGcs.CLstat.ML

Official code: deepakn97/relationPrediction (524 stars, last commit 2021-06-03).

Abstract

The recent proliferation of knowledge graphs (KGs) coupled with incomplete or partial information, in the form of missing relations (links) between entities, has fueled a lot of research on knowledge base completion (also known as relation prediction). Several recent works suggest that convolutional neural network (CNN) based models generate richer and more expressive feature embeddings and hence also perform well on relation prediction. However, we observe that these KG embeddings treat triples independently and thus fail to cover the complex and hidden information that is inherently implicit in the local neighborhood surrounding a triple. To this effect, our paper proposes a novel attention based feature embedding that captures both entity and relation features in any given entity's neighborhood. Additionally, we also encapsulate relation clusters and multihop relations in our model. Our empirical study offers insights into the efficacy of our attention based model and we show marked performance gains in comparison to state of the art methods on all datasets.

View on arXivView PDF

Code Implementations(1)

ACL 2019: Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs

524123Shell, PythonMar 3, 20195 years ago

Similar Papers

Cite this paper

@article{nathani2019learning,
  title  = {Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs},
  author = {Deepak Nathani and Jatin Chauhan and Charu Sharma and Manohar Kaul},
  year   = {2019},
  eprint = {1906.01195},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1906.01195}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1906.01195.svg)](https://codeofpaper.com/paper/1906.01195)

Discussion