Learning Entity and Relation Embeddings for Knowledge Resolution

75Citations
Citations of this article
476Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Knowledge resolution is the task of clustering knowledge mentions, e.g., entity and relation mentions into several disjoint groups with each group representing a unique entity or relation. Such resolution is a central step in constructing high-quality knowledge graph from unstructured text. Previous research has tackled this problem by making use of various textual and structural features from a semantic dictionary or a knowledge graph. This may lead to poor performance on knowledge mentions with poor or not well-known contexts. In addition, it is also limited by the coverage of the semantic dictionary or knowledge graph. In this work, we propose ETransR, a method which automatically learns entity and relation feature representations in continuous vector spaces, in order to measure the semantic relatedness of knowledge mentions for knowledge resolution. Experimental results on two benchmark datasets show that our proposed method delivers significant improvements compared with the state-of-the-art baselines on the task of knowledge resolution.

Cite

CITATION STYLE

APA

Lin, H., Liu, Y., Wang, W., Yue, Y., & Lin, Z. (2017). Learning Entity and Relation Embeddings for Knowledge Resolution. In Procedia Computer Science (Vol. 108, pp. 345–354). Elsevier B.V. https://doi.org/10.1016/j.procs.2017.05.045

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