IDEAS home Printed from https://ideas.repec.org/a/bla/jamist/v61y2010i6p1081-1091.html
   My bibliography  Save this article

Query polyrepresentation for ranking retrieval systems without relevance judgments

Author

Listed:
  • Miles Efron
  • Megan Winget

Abstract

Ranking information retrieval (IR) systems with respect to their effectiveness is a crucial operation during IR evaluation, as well as during data fusion. This article offers a novel method of approaching the system‐ranking problem, based on the widely studied idea of polyrepresentation. The principle of polyrepresentation suggests that a single information need can be represented by many query articulations–what we call query aspects. By skimming the top k (where k is small) documents retrieved by a single system for multiple query aspects, we collect a set of documents that are likely to be relevant to a given test topic. Labeling these skimmed documents as putatively relevant lets us build pseudorelevance judgments without undue human intervention. We report experiments where using these pseudorelevance judgments delivers a rank ordering of IR systems that correlates highly with rankings based on human relevance judgments.

Suggested Citation

  • Miles Efron & Megan Winget, 2010. "Query polyrepresentation for ranking retrieval systems without relevance judgments," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 61(6), pages 1081-1091, June.
  • Handle: RePEc:bla:jamist:v:61:y:2010:i:6:p:1081-1091
    DOI: 10.1002/asi.21310
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/asi.21310?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:jamist:v:61:y:2010:i:6:p:1081-1091. 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.