skip to main content
10.1145/3477495.3531888acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
short-paper

Learning to Rank Knowledge Subgraph Nodes for Entity Retrieval

Published:07 July 2022Publication History

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.

Skip Supplemental Material Section

Supplemental Material

SIGIR22-fp1980.mp4

mp4

7.1 MB

References

  1. Shubham Chatterjee and Laura Dietz. 2021. Entity Retrieval Using Fine-Grained Entity Aspects. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval . 1662--1666.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Nicola De Cao, Gautier Izacard, Sebastian Riedel, and Fabio Petroni. 2020. Autoregressive Entity Retrieval. In International Conference on Learning Representations .Google ScholarGoogle Scholar
  3. Laura Dietz. 2019. ENT Rank: Retrieving entities for topical information needs through entity-neighbor-text relations. In Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval . 215--224.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Laura Dietz, Manisha Verma, Filip Radlinski, and Nick Craswell. 2017. TREC Complex Answer Retrieval Overview.. In TREC .Google ScholarGoogle Scholar
  5. Paolo Ferragina and Ugo Scaiella. 2010. Tagme: on-the-fly annotation of short text fragments (by wikipedia entities). In Proceedings of the 19th ACM international conference on Information and knowledge management. 1625--1628.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Emma J Gerritse, Faegheh Hasibi, and Arjen P de Vries. 2020. Graph-embedding empowered entity retrieval. In European Conference on Information Retrieval . Springer, 97--110.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Daniel Gillick, Sayali Kulkarni, Larry Lansing, Alessandro Presta, Jason Baldridge, Eugene Ie, and Diego Garcia-Olano. 2019. Learning dense representations for entity retrieval. arXiv preprint arXiv:1909.10506 (2019).Google ScholarGoogle Scholar
  8. Faegheh Hasibi, Krisztian Balog, and Svein Erik Bratsberg. 2016. Exploiting entity linking in queries for entity retrieval. In Proceedings of the 2016 acm international conference on the theory of information retrieval . 209--218.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Faegheh Hasibi, Fedor Nikolaev, Chenyan Xiong, Krisztian Balog, Svein Erik Bratsberg, Alexander Kotov, and Jamie Callan. 2017. DBpedia-entity v2: a test collection for entity search. In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval . 1265--1268.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Shoaib Jameel, Zied Bouraoui, and Steven Schockaert. 2017. Member: Max-margin based embeddings for entity retrieval. In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval. 783--792.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Donald Metzler and W Bruce Croft. 2005. A markov random field model for term dependencies. In Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval . 472--479.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Fedor Nikolaev and Alexander Kotov. 2020. Joint word and entity embeddings for entity retrieval from a knowledge graph. In European Conference on Information Retrieval. Springer, 141--155.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Fedor Nikolaev, Alexander Kotov, and Nikita Zhiltsov. 2016. Parameterized fielded term dependence models for ad-hoc entity retrieval from knowledge graph. In Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval . 435--444.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Jordan Ramsdell and Laura Dietz. 2020. A Large Test Collection for Entity Aspect Linking. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management . 3109--3116.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Chen Zhao, Chenyan Xiong, Xin Qian, and Jordan Boyd-Graber. 2020. Complex factoid question answering with a free-text knowledge graph. In Proceedings of The Web Conference 2020. 1205--1216.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Nikita Zhiltsov, Alexander Kotov, and Fedor Nikolaev. 2015. Fielded sequential dependence model for ad-hoc entity retrieval in the web of data. In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval . 253--262.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Learning to Rank Knowledge Subgraph Nodes for Entity Retrieval

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGIR '22: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval
        July 2022
        3569 pages
        ISBN:9781450387323
        DOI:10.1145/3477495

        Copyright © 2022 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 7 July 2022

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • short-paper

        Acceptance Rates

        Overall Acceptance Rate792of3,983submissions,20%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader