0

Named Entity Disambiguation using Deep Learning on Graphs

A study finds that \ac{Bi-LSTM} encoding graph triplets outperforms baseline models for named entity disambiguation using \wikidata{} graphs.

Year
2018
Venue
arXiv 2018
Authors
5
Hosting
Abstract onlyARXIV-DEFAULT

Cite

Notes

Only stored in your browser.

Attribution

Abstract & full text
arxiv.org/abs/1810.09164ARXIV-DEFAULT
TL;DR
Semantic Scholar
Attribution policy →

Abstract

We tackle \ac{NED} by comparing entities in short sentences with \wikidata{} graphs. Creating a context vector from graphs through deep learning is a challenging problem that has never been applied to \ac{NED}. Our main contribution is to present an experimental study of recent neural techniques, as well as a discussion about which graph features are most important for the disambiguation task. In addition, a new dataset (\wikidatadisamb{}) is created to allow a clean and scalable evaluation of \ac{NED} with \wikidata{} entries, and to be used as a reference in future research. In the end our results show that a \ac{Bi-LSTM} encoding of the graph triplets performs best, improving upon the baseline models and scoring an \rm{F1} value of $91.6%$ on the \wikidatadisamb{} test set

Authors

5