一种针对Shilling攻击的改进协同过滤推荐算法

Ruoxuan Wei, Hong Shen
{"title":"一种针对Shilling攻击的改进协同过滤推荐算法","authors":"Ruoxuan Wei, Hong Shen","doi":"10.1109/PDCAT.2016.077","DOIUrl":null,"url":null,"abstract":"Collaborative Filtering (CF) is a successful technology that has been implemented in E-commerce recommender systems. However, the risks of shilling attacks have already aroused increasing concerns of the society. Current solutions mainly focus on attack detection methods and robust CF algorithms that have flaws of unassured prediction accuracy. Furthermore, attack detection methods require a threshold to distinguish normal users from fake users and suffer from the problems of false positive if the threshold is too high and false negative if too low. This paper proposes a soft-decision method, Neighbor Selection with Variable-Length Partitions (VLPNS), to reduce false positive rate through marking suspicious fakers instead of deleting them directly such that misclassified normal users can still contribute to the similarity calculation. The method works as follows: First, it gets user's suspicion probability by applying SVM. It then generates partitions of variable sizes from which different numbers of neighbors can be selected by using the bisecting c-means clustering algorithm. Finally, it chooses neighbors considering the user's suspicion degree and similarity with target user at the same time. Theoretical and experimental analysis show that our approach ensures an excellent prediction accuracy against shilling attacks.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Collaborative Filtering Recommendation Algorithm against Shilling Attacks\",\"authors\":\"Ruoxuan Wei, Hong Shen\",\"doi\":\"10.1109/PDCAT.2016.077\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collaborative Filtering (CF) is a successful technology that has been implemented in E-commerce recommender systems. However, the risks of shilling attacks have already aroused increasing concerns of the society. Current solutions mainly focus on attack detection methods and robust CF algorithms that have flaws of unassured prediction accuracy. Furthermore, attack detection methods require a threshold to distinguish normal users from fake users and suffer from the problems of false positive if the threshold is too high and false negative if too low. This paper proposes a soft-decision method, Neighbor Selection with Variable-Length Partitions (VLPNS), to reduce false positive rate through marking suspicious fakers instead of deleting them directly such that misclassified normal users can still contribute to the similarity calculation. The method works as follows: First, it gets user's suspicion probability by applying SVM. It then generates partitions of variable sizes from which different numbers of neighbors can be selected by using the bisecting c-means clustering algorithm. Finally, it chooses neighbors considering the user's suspicion degree and similarity with target user at the same time. Theoretical and experimental analysis show that our approach ensures an excellent prediction accuracy against shilling attacks.\",\"PeriodicalId\":203925,\"journal\":{\"name\":\"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2016.077\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2016.077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

协同过滤(CF)是一项成功的技术,已在电子商务推荐系统中实现。然而,先令攻击的风险已经引起了社会越来越多的关注。目前的解决方案主要集中在攻击检测方法和鲁棒CF算法上,存在预测精度不确定的缺陷。此外,攻击检测方法需要一个阈值来区分正常用户和虚假用户,并且存在阈值过高和过低会导致误报的问题。本文提出了一种软决策方法——可变长分区邻居选择(VLPNS),通过标记可疑的伪造者而不是直接删除它们来降低误报率,使得错误分类的正常用户仍然可以用于相似度计算。该方法的工作原理如下:首先,利用支持向量机得到用户的怀疑概率;然后,它生成可变大小的分区,通过使用等分c均值聚类算法可以从中选择不同数量的邻居。最后,同时考虑用户的怀疑程度和与目标用户的相似度,选择邻居。理论和实验分析表明,我们的方法对先令攻击有很好的预测精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Improved Collaborative Filtering Recommendation Algorithm against Shilling Attacks
Collaborative Filtering (CF) is a successful technology that has been implemented in E-commerce recommender systems. However, the risks of shilling attacks have already aroused increasing concerns of the society. Current solutions mainly focus on attack detection methods and robust CF algorithms that have flaws of unassured prediction accuracy. Furthermore, attack detection methods require a threshold to distinguish normal users from fake users and suffer from the problems of false positive if the threshold is too high and false negative if too low. This paper proposes a soft-decision method, Neighbor Selection with Variable-Length Partitions (VLPNS), to reduce false positive rate through marking suspicious fakers instead of deleting them directly such that misclassified normal users can still contribute to the similarity calculation. The method works as follows: First, it gets user's suspicion probability by applying SVM. It then generates partitions of variable sizes from which different numbers of neighbors can be selected by using the bisecting c-means clustering algorithm. Finally, it chooses neighbors considering the user's suspicion degree and similarity with target user at the same time. Theoretical and experimental analysis show that our approach ensures an excellent prediction accuracy against shilling attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Learning-Based System for Monitoring Electrical Load in Smart Grid A Domain-Independent Hybrid Approach for Automatic Taxonomy Induction CUDA-Based Parallel Implementation of IBM Word Alignment Algorithm for Statistical Machine Translation Optimal Scheduling Algorithm of MapReduce Tasks Based on QoS in the Hybrid Cloud Pre-Impact Fall Detection Based on Wearable Device Using Dynamic Threshold Model
×
引用
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