Learning to Rank Knowledge Subgraph Nodes for Entity Retrieval

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

Abstract

The importance of entity retrieval, the task of retrieving a ranked list of related entities from big knowledge bases given a textual query, has been widely acknowledged in the literature. In this paper, we propose a novel entity retrieval method that addresses the important challenge that revolves around the need to effectively represent and model context in which entities relate to each other. Based on our proposed method, a model is firstly trained to retrieve and prune a subgraph of a textual knowledge graph that represents contextual relationships between entities. Secondly, a deep model is introduced to reason over the textual content of nodes, edges, and the given question and score and rank entities in the subgraph. We show experimentally that our approach outperforms state-of-the-art methods on a number of benchmarks for entity retrieval.

Cite

CITATION STYLE

APA

Jafarzadeh, P., Amirmahani, Z., & Ensan, F. (2022). Learning to Rank Knowledge Subgraph Nodes for Entity Retrieval. In SIGIR 2022 - Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 2519–2523). Association for Computing Machinery, Inc. https://doi.org/10.1145/3477495.3531888

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