基于客观信用的恶意干扰稳健等级聚合法

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Applied Soft Computing Pub Date : 2024-11-19 DOI:10.1016/j.asoc.2024.112471
Dongmei Chen , Yu Xiao , Huan Zhu , Ye Deng , Jun Wu
{"title":"基于客观信用的恶意干扰稳健等级聚合法","authors":"Dongmei Chen ,&nbsp;Yu Xiao ,&nbsp;Huan Zhu ,&nbsp;Ye Deng ,&nbsp;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":"{\"title\":\"A robust rank aggregation method for malicious disturbance based on objective credit\",\"authors\":\"Dongmei Chen ,&nbsp;Yu Xiao ,&nbsp;Huan Zhu ,&nbsp;Ye Deng ,&nbsp;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}","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

摘要

排名聚合是一项将单个排名合并成共识的任务,在从社会选择到信息检索等许多领域都有广泛应用。由于某些用户可能有动机扰乱聚合排名以获取巨大利益,因此,如何使排名聚合方法对恶意干扰具有鲁棒性就成了一个重要挑战。在本研究中,我们提出了一种基于客观信用的稳健排名聚合方法。其基本思想是,通过将多个输入排名与用户信用相结合来获得一个共识排名,而用户信用则通过其输入排名与共识排名之间的差异来反映。这一想法激发了一种新颖的迭代算法,该算法通过用户信用加权迭代更新共识排名,并通过测量与共识排名的差异来修改用户信用,直至所有信用趋同。这样,该算法就能客观地为用户分配不同的信用,从而获得更可靠的综合排名。在合成数据和真实数据上进行的大量实验证明,我们的方法比最先进的基线方法性能更优越。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A robust rank aggregation method for malicious disturbance based on objective credit
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
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: 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.
期刊最新文献
Editorial Board Editorial Board Adolescent mental health state assessment framework by combining YOLO with random forest Leveraging more information for blind stereo super-resolution via large-window cross-attention Optimized hybrid XGBoost-CatBoost model for enhanced prediction of concrete strength and reliability analysis using Monte Carlo simulations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1