Abstract

Rank aggregation is an obligatory operation for many tasks of democratic elections, product recommendation, and gene identification. While the awareness of imperfect information in input rankings would lead to unreliable aggregation results has promoted the robust rank aggregation to become an increasingly active research topic recently. In this study, we focus on the problem of robustness measuring of rank aggregation methods. We first provide an analytical framework of rank aggregation robustness, in which we generate rankings with adjustable imperfect information and observe the response of rank aggregation methods. In particular, to quantify the robustness of rank aggregation methods, we introduce the concept of error-effectiveness curve, which presents the aggregation effectiveness under different imperfect information scenarios, and describes the ability of each method in giving stable aggregation results. By doing so, a robustness measure of rank aggregation with random error is developed. Comprehensive experimental evaluations were conducted considering synthetic datasets with various levels of random error to demonstrate the validity of the proposed measure. Exact robustness was quantified for each evaluated rank aggregation methods, and significant robustness distinctions were achieved among them.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.