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

iRANK: A rank‐learn‐combine framework for unsupervised ensemble ranking

Author

Listed:
  • Furu Wei
  • Wenjie Li
  • Shixia Liu

Abstract

The authors address the problem of unsupervised ensemble ranking. Traditional approaches either combine multiple ranking criteria into a unified representation to obtain an overall ranking score or to utilize certain rank fusion or aggregation techniques to combine the ranking results. Beyond the aforementioned “combine‐then‐rank” and “rank‐then‐combine” approaches, the authors propose a novel “rank‐learn‐combine” ranking framework, called Interactive Ranking (iRANK), which allows two base rankers to “teach” each other before combination during the ranking process by providing their own ranking results as feedback to the others to boost the ranking performance. This mutual ranking refinement process continues until the two base rankers cannot learn from each other any more. The overall performance is improved by the enhancement of the base rankers through the mutual learning mechanism. The authors further design two ranking refinement strategies to efficiently and effectively use the feedback based on reasonable assumptions and rational analysis. Although iRANK is applicable to many applications, as a case study, they apply this framework to the sentence ranking problem in query‐focused summarization and evaluate its effectiveness on the DUC 2005 and 2006 data sets. The results are encouraging with consistent and promising improvements.

Suggested Citation

  • Furu Wei & Wenjie Li & Shixia Liu, 2010. "iRANK: A rank‐learn‐combine framework for unsupervised ensemble ranking," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 61(6), pages 1232-1243, June.
  • Handle: RePEc:bla:jamist:v:61:y:2010:i:6:p:1232-1243
    DOI: 10.1002/asi.21296
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/asi.21296?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:1232-1243. 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.