Named Entity Disambiguation using Deep Learning on Graphs
원문 초록
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
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
RAKG:Document-level Retrieval Augmented Knowledge Graph Construction
FewTopNER: Integrating Few-Shot Learning with Topic Modeling and Named Entity Recognition in a Multilingual Framework
Enriching Social Science Research via Survey Item Linking
Unsupervised Named Entity Disambiguation for Low Resource Domains
Newswire: A Large-Scale Structured Database of a Century of Historical News
REXEL: An End-to-end Model for Document-Level Relation Extraction and Entity Linking
토론
이 논문과 연결된 포럼 글이 아직 없습니다.