针对二部网络推荐算法的配置文件注入攻击分析

Zhang Fuguo
{"title":"针对二部网络推荐算法的配置文件注入攻击分析","authors":"Zhang Fuguo","doi":"10.1109/ICMECG.2014.10","DOIUrl":null,"url":null,"abstract":"Despite their great adoption in e-commerce sites, recommender systems are still vulnerable to unscrupulous producers who try to promote their products by shilling the systems. In the past decade, network based recommendation approaches have been demonstrated to be both more efficient and of lower computational complexity than collaborative filtering methods, however as far as we know, there is rare research on the robustness of network based recommendation approaches. In this paper, we conducted a serious of experiments to examine the robustness of five typical network based recommendation algorithms. The empirical results obtained from the movielens dataset show that all the two limited knowledge shilling attacks are successful against the network based algorithms, and the bandwagon attack affects very strongly against most network based recommendation algorithms, especially the algorithms considering the preferential diffusion at the last step. One way to relieve the attack impact is to assign the algorithm a heterogeneous initial resource configuration.","PeriodicalId":413431,"journal":{"name":"2014 International Conference on Management of e-Commerce and e-Government","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Analysis of Profile Injection Attacks against Recommendation Algorithms on Bipartite Networks\",\"authors\":\"Zhang Fuguo\",\"doi\":\"10.1109/ICMECG.2014.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Despite their great adoption in e-commerce sites, recommender systems are still vulnerable to unscrupulous producers who try to promote their products by shilling the systems. In the past decade, network based recommendation approaches have been demonstrated to be both more efficient and of lower computational complexity than collaborative filtering methods, however as far as we know, there is rare research on the robustness of network based recommendation approaches. In this paper, we conducted a serious of experiments to examine the robustness of five typical network based recommendation algorithms. The empirical results obtained from the movielens dataset show that all the two limited knowledge shilling attacks are successful against the network based algorithms, and the bandwagon attack affects very strongly against most network based recommendation algorithms, especially the algorithms considering the preferential diffusion at the last step. One way to relieve the attack impact is to assign the algorithm a heterogeneous initial resource configuration.\",\"PeriodicalId\":413431,\"journal\":{\"name\":\"2014 International Conference on Management of e-Commerce and e-Government\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Management of e-Commerce and e-Government\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMECG.2014.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Management of e-Commerce and e-Government","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMECG.2014.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

尽管在电子商务网站得到了广泛的应用,但推荐系统仍然容易受到不择手段的生产者的攻击,他们试图通过贿赂系统来推销自己的产品。在过去的十年中,基于网络的推荐方法被证明比协同过滤方法更高效、计算复杂度更低,但据我们所知,关于基于网络的推荐方法鲁棒性的研究很少。在本文中,我们进行了一系列的实验来检验五种典型的基于网络的推荐算法的鲁棒性。从movielens数据集获得的经验结果表明,这两种有限知识屏蔽攻击对基于网络的推荐算法都是成功的,而从众攻击对大多数基于网络的推荐算法,尤其是最后一步考虑优先扩散的推荐算法的影响非常大。一种减轻攻击影响的方法是为算法分配异构初始资源配置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis of Profile Injection Attacks against Recommendation Algorithms on Bipartite Networks
Despite their great adoption in e-commerce sites, recommender systems are still vulnerable to unscrupulous producers who try to promote their products by shilling the systems. In the past decade, network based recommendation approaches have been demonstrated to be both more efficient and of lower computational complexity than collaborative filtering methods, however as far as we know, there is rare research on the robustness of network based recommendation approaches. In this paper, we conducted a serious of experiments to examine the robustness of five typical network based recommendation algorithms. The empirical results obtained from the movielens dataset show that all the two limited knowledge shilling attacks are successful against the network based algorithms, and the bandwagon attack affects very strongly against most network based recommendation algorithms, especially the algorithms considering the preferential diffusion at the last step. One way to relieve the attack impact is to assign the algorithm a heterogeneous initial resource configuration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信