IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i2p308-326.html
   My bibliography  Save this article

Heuristic Search for Rank Aggregation with Application to Label Ranking

Author

Listed:
  • Yangming Zhou

    (Sino-US Global Logistics Institute, Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, China; Data-Driven Management Decision Making Lab, Shanghai Jiao Tong University, Shanghai 200030, China)

  • Jin-Kao Hao

    (Department of Computer Science, Université d’Angers, Angers 49045, France)

  • Zhen Li

    (Tencent Technology (Shanghai) Company Limited, Shanghai 200233, China)

Abstract

Rank aggregation combines the preference rankings of multiple alternatives from different voters into a single consensus ranking, providing a useful model for a variety of practical applications but posing a computationally challenging problem. In this paper, we provide an effective hybrid evolutionary ranking algorithm to solve the rank aggregation problem with both complete and partial rankings. The algorithm features a semantic crossover based on concordant pairs and an enhanced late acceptance local search method reinforced by a relaxed acceptance and replacement strategy and a fast incremental evaluation mechanism. Experiments are conducted to assess the algorithm, indicating a highly competitive performance on both synthetic and real-world benchmark instances compared with state-of-the-art algorithms. To demonstrate its practical usefulness, the algorithm is applied to label ranking, a well-established machine learning task. We additionally analyze several key algorithmic components to gain insight into their operation.

Suggested Citation

  • Yangming Zhou & Jin-Kao Hao & Zhen Li, 2024. "Heuristic Search for Rank Aggregation with Application to Label Ranking," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 308-326, March.
    • Handle: RePEc:inm:orijoc:v:36:y:2024:i:2:p:308-326
    DOI: 10.1287/ijoc.2022.0019
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2022.0019
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2022.0019?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
    ---><---

    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:inm:orijoc:v:36:y:2024:i:2:p:308-326. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.