Dongmei Chen , Yu Xiao , Huan Zhu , Ye Deng , Jun Wu
{"title":"A robust rank aggregation method for malicious disturbance based on objective credit","authors":"Dongmei Chen , Yu Xiao , Huan Zhu , Ye Deng , Jun Wu","doi":"10.1016/j.asoc.2024.112471","DOIUrl":null,"url":null,"abstract":"<div><div>Rank aggregation is a task of combining individual rankings into a consensus, which has widespread applications in many areas, ranging from social choice to information retrieval. As some users may have incentives to disrupt the aggregated ranking for enormous benefits, making rank aggregation methods robust to malicious disturbance becomes a crucial challenge. In this study, we propose a robust rank aggregation method based on objective credit. The underlying idea is that a consensus ranking is obtained by combining multiple input rankings with users’ credit, while users’ credit is reflected by the differences between their input rankings and the consensus ranking. This idea motivates a novel iterative algorithm, which iteratively updates a consensus ranking weighted by users’ credit and modifies users’ credit by measuring the differences from a consensus ranking until all credit converges. In this way, the algorithm objectively assigns different credit to users, leading to a more reliable aggregated ranking. Extensive experiments on synthetic and real data demonstrate the superior performance of our method over state-of-the-art baselines.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"167 ","pages":"Article 112471"},"PeriodicalIF":7.2000,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494624012456","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Rank aggregation is a task of combining individual rankings into a consensus, which has widespread applications in many areas, ranging from social choice to information retrieval. As some users may have incentives to disrupt the aggregated ranking for enormous benefits, making rank aggregation methods robust to malicious disturbance becomes a crucial challenge. In this study, we propose a robust rank aggregation method based on objective credit. The underlying idea is that a consensus ranking is obtained by combining multiple input rankings with users’ credit, while users’ credit is reflected by the differences between their input rankings and the consensus ranking. This idea motivates a novel iterative algorithm, which iteratively updates a consensus ranking weighted by users’ credit and modifies users’ credit by measuring the differences from a consensus ranking until all credit converges. In this way, the algorithm objectively assigns different credit to users, leading to a more reliable aggregated ranking. Extensive experiments on synthetic and real data demonstrate the superior performance of our method over state-of-the-art baselines.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.