IDEAS home Printed from https://ideas.repec.org/a/bla/jinfst/v71y2020i3p264-281.html
   My bibliography  Save this article

A simple kernel co‐occurrence‐based enhancement for pseudo‐relevance feedback

Author

Listed:
  • Min Pan
  • Jimmy Xiangji Huang
  • Tingting He
  • Zhiming Mao
  • Zhiwei Ying
  • Xinhui Tu

Abstract

Pseudo‐relevance feedback is a well‐studied query expansion technique in which it is assumed that the top‐ranked documents in an initial set of retrieval results are relevant and expansion terms are then extracted from those documents. When selecting expansion terms, most traditional models do not simultaneously consider term frequency and the co‐occurrence relationships between candidate terms and query terms. Intuitively, however, a term that has a higher co‐occurrence with a query term is more likely to be related to the query topic. In this article, we propose a kernel co‐occurrence‐based framework to enhance retrieval performance by integrating term co‐occurrence information into the Rocchio model and a relevance language model (RM3). Specifically, a kernel co‐occurrence‐based Rocchio method (KRoc) and a kernel co‐occurrence‐based RM3 method (KRM3) are proposed. In our framework, co‐occurrence information is incorporated into both the factor of the term discrimination power and the factor of the within‐document term weight to boost retrieval performance. The results of a series of experiments show that our proposed methods significantly outperform the corresponding strong baselines over all data sets in terms of the mean average precision and over most data sets in terms of P@10. A direct comparison of standard Text Retrieval Conference data sets indicates that our proposed methods are at least comparable to state‐of‐the‐art approaches.

Suggested Citation

  • Min Pan & Jimmy Xiangji Huang & Tingting He & Zhiming Mao & Zhiwei Ying & Xinhui Tu, 2020. "A simple kernel co‐occurrence‐based enhancement for pseudo‐relevance feedback," Journal of the Association for Information Science & Technology, Association for Information Science & Technology, vol. 71(3), pages 264-281, March.
  • Handle: RePEc:bla:jinfst:v:71:y:2020:i:3:p:264-281
    DOI: 10.1002/asi.24241
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.24241
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asi.24241?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jinfst:v:71:y:2020:i:3:p:264-281. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.