Named entity disambiguation via probabilistic graphical model with embedding features

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

Abstract

Named entity disambiguation (NED) is the task of linking ambiguous mentions in text to their corresponding entities in a given knowledge base, such as Wikipedia. State-of-the-art NED solutions harness neural networks to generate abstract representations, i.e., embeddings, of mentions and entities, based on which the disambiguation process can be achieved by finding entity with the most similar representation to mention. Nevertheless, the coherence among mentions, and their corresponding entities, is yet neglected. To fill this gap, in this work, we put forward intra, an approach effectively integrating embedding features into a collective disambiguation framework, i.e., probabilistic graphical model. Markov Chain Monte Carlo sampling and SampleRank algorithm are implemented for model parameters learning and inference. We evaluate intra on existing dataset against several state-of-the-art NED systems, which validates the effectiveness of our proposed method.

Cite

CITATION STYLE

APA

Zeng, W., Tang, J., Zhao, X., Ge, B., & Xiao, W. (2018). Named entity disambiguation via probabilistic graphical model with embedding features. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11303 LNCS, pp. 16–27). Springer Verlag. https://doi.org/10.1007/978-3-030-04182-3_2

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