在线市场中健壮的隐私保护联合项目排名:利用平台声誉进行有效聚合

IF 7.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Big Data Pub Date : 2024-11-22 DOI:10.1109/TBDATA.2024.3505055
Guilherme Ramos;Ludovico Boratto;Mirko Marras
{"title":"在线市场中健壮的隐私保护联合项目排名:利用平台声誉进行有效聚合","authors":"Guilherme Ramos;Ludovico Boratto;Mirko Marras","doi":"10.1109/TBDATA.2024.3505055","DOIUrl":null,"url":null,"abstract":"Online marketplaces often collect products to sell from several other platforms (and sellers) and produce a unique ranking/score of these products to users. Keeping as private the user preferences provided in each (individual) platform is a need and a challenge at the same time. We are currently used to rating items in the marketplace itself which, in turn, can produce more effective rankings. Hence, the shaping of an effective item ranking would require a sharing of the user ratings between the individual platforms and the marketplace, thus impacting users’ privacy. In this paper, we propose the initial steps towards a change of paradigm, where the ratings are kept as private in each platform. Under this paradigm, each platform produces its rankings, then aggregated by the marketplace, in a federated fashion. To ensure that the marketplace’s rankings maintain their effectiveness, we exploit the concept of <italic>reputation of the individual platform</i>, so that the final marketplace ranking is weighted by the reputation of each platform providing its ranking. Experiments on three datasets, covering different use cases, show that our approach can produce effective rankings, improving robustness to attacks, while keeping user preference data private within each seller platform.","PeriodicalId":13106,"journal":{"name":"IEEE Transactions on Big Data","volume":"11 1","pages":"303-309"},"PeriodicalIF":7.5000,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robust Privacy-Preserving Federated Item Ranking in Online Marketplaces: Exploiting Platform Reputation for Effective Aggregation\",\"authors\":\"Guilherme Ramos;Ludovico Boratto;Mirko Marras\",\"doi\":\"10.1109/TBDATA.2024.3505055\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online marketplaces often collect products to sell from several other platforms (and sellers) and produce a unique ranking/score of these products to users. Keeping as private the user preferences provided in each (individual) platform is a need and a challenge at the same time. We are currently used to rating items in the marketplace itself which, in turn, can produce more effective rankings. Hence, the shaping of an effective item ranking would require a sharing of the user ratings between the individual platforms and the marketplace, thus impacting users’ privacy. In this paper, we propose the initial steps towards a change of paradigm, where the ratings are kept as private in each platform. Under this paradigm, each platform produces its rankings, then aggregated by the marketplace, in a federated fashion. To ensure that the marketplace’s rankings maintain their effectiveness, we exploit the concept of <italic>reputation of the individual platform</i>, so that the final marketplace ranking is weighted by the reputation of each platform providing its ranking. Experiments on three datasets, covering different use cases, show that our approach can produce effective rankings, improving robustness to attacks, while keeping user preference data private within each seller platform.\",\"PeriodicalId\":13106,\"journal\":{\"name\":\"IEEE Transactions on Big Data\",\"volume\":\"11 1\",\"pages\":\"303-309\"},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2024-11-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Big Data\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10764746/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Big Data","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10764746/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在线市场通常从其他几个平台(和卖家)收集产品,并向用户提供这些产品的独特排名/分数。保持每个(单独)平台中提供的用户首选项的私密性是一种需求,同时也是一种挑战。我们目前习惯于在市场上对商品进行评级,这反过来又能产生更有效的排名。因此,要形成一个有效的商品排名,就需要在各个平台和市场之间共享用户评分,从而影响用户的隐私。在本文中,我们提出了改变范式的初步步骤,其中评级在每个平台中都是私有的。在这种模式下,每个平台产生自己的排名,然后由市场以联合的方式汇总。为了确保市场排名保持其有效性,我们利用了单个平台声誉的概念,因此最终的市场排名是由每个提供排名的平台的声誉加权的。在涵盖不同用例的三个数据集上进行的实验表明,我们的方法可以产生有效的排名,提高对攻击的鲁棒性,同时在每个卖家平台内保持用户偏好数据的私密性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Robust Privacy-Preserving Federated Item Ranking in Online Marketplaces: Exploiting Platform Reputation for Effective Aggregation
Online marketplaces often collect products to sell from several other platforms (and sellers) and produce a unique ranking/score of these products to users. Keeping as private the user preferences provided in each (individual) platform is a need and a challenge at the same time. We are currently used to rating items in the marketplace itself which, in turn, can produce more effective rankings. Hence, the shaping of an effective item ranking would require a sharing of the user ratings between the individual platforms and the marketplace, thus impacting users’ privacy. In this paper, we propose the initial steps towards a change of paradigm, where the ratings are kept as private in each platform. Under this paradigm, each platform produces its rankings, then aggregated by the marketplace, in a federated fashion. To ensure that the marketplace’s rankings maintain their effectiveness, we exploit the concept of reputation of the individual platform, so that the final marketplace ranking is weighted by the reputation of each platform providing its ranking. Experiments on three datasets, covering different use cases, show that our approach can produce effective rankings, improving robustness to attacks, while keeping user preference data private within each seller platform.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
11.80
自引率
2.80%
发文量
114
期刊介绍: The IEEE Transactions on Big Data publishes peer-reviewed articles focusing on big data. These articles present innovative research ideas and application results across disciplines, including novel theories, algorithms, and applications. Research areas cover a wide range, such as big data analytics, visualization, curation, management, semantics, infrastructure, standards, performance analysis, intelligence extraction, scientific discovery, security, privacy, and legal issues specific to big data. The journal also prioritizes applications of big data in fields generating massive datasets.
期刊最新文献
2024 Reviewers List* Robust Privacy-Preserving Federated Item Ranking in Online Marketplaces: Exploiting Platform Reputation for Effective Aggregation Guest Editorial TBD Special Issue on Graph Machine Learning for Recommender Systems Data-Centric Graph Learning: A Survey Reliable Data Augmented Contrastive Learning for Sequential Recommendation
×
引用
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