Detecting Fake Co-visitation Injection Attack in Graph-based Recommendation Systems

Tropa Mahmood, Muhammad Abdullah Adnan
{"title":"Detecting Fake Co-visitation Injection Attack in Graph-based Recommendation Systems","authors":"Tropa Mahmood, Muhammad Abdullah Adnan","doi":"10.1145/3569551.3569556","DOIUrl":null,"url":null,"abstract":"Recommendation systems are vulnerable to injection attacks by malicious users due to their fundamental openness. One of the vulnerabilities is the fake co-visitation injection attack, which significantly impacts recommendation systems since it modifies the system according to the attacker’s wishes. To date, the detection of co-visitation injection attacks is challenging as: (1) the choice of attribute representation of nodes is hard, (2) practical evidence for analyzing and detecting anomalies in real-world data is insufficient, (3) it is challenging to filter between the original and injected co-visitation data in terms of node behaviors. This paper investigates a unified detection framework that combines attribute and network structure information synergistically to detect outlier nodes based on CUR decomposition and residual analysis. At first, co-visitation graphs are constructed using association rules, and attribute representations of their nodes are developed. Then, both attributes and network structure information are blended in order to identify suspicious nodes. Extensive experiments on both synthetic and real-world dataset exhibit the efficacy of the proposed detection approach compared to other state-of-the-art approaches. The experimental results show that the detection performance can improve by up to 50% for co-visitation injection attacks over the baselines in terms of false alarm rate (FAR) while keeping the highest detection rate (DR).","PeriodicalId":177068,"journal":{"name":"Proceedings of the 9th International Conference on Networking, Systems and Security","volume":"28 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 9th International Conference on Networking, Systems and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3569551.3569556","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recommendation systems are vulnerable to injection attacks by malicious users due to their fundamental openness. One of the vulnerabilities is the fake co-visitation injection attack, which significantly impacts recommendation systems since it modifies the system according to the attacker’s wishes. To date, the detection of co-visitation injection attacks is challenging as: (1) the choice of attribute representation of nodes is hard, (2) practical evidence for analyzing and detecting anomalies in real-world data is insufficient, (3) it is challenging to filter between the original and injected co-visitation data in terms of node behaviors. This paper investigates a unified detection framework that combines attribute and network structure information synergistically to detect outlier nodes based on CUR decomposition and residual analysis. At first, co-visitation graphs are constructed using association rules, and attribute representations of their nodes are developed. Then, both attributes and network structure information are blended in order to identify suspicious nodes. Extensive experiments on both synthetic and real-world dataset exhibit the efficacy of the proposed detection approach compared to other state-of-the-art approaches. The experimental results show that the detection performance can improve by up to 50% for co-visitation injection attacks over the baselines in terms of false alarm rate (FAR) while keeping the highest detection rate (DR).
基于图的推荐系统中伪共同访问注入攻击检测
推荐系统由于其基本的开放性,容易受到恶意用户的注入攻击。其中一个漏洞是虚假共同访问注入攻击,它会根据攻击者的意愿修改系统,从而严重影响推荐系统。迄今为止,共访问注入攻击的检测面临着以下挑战:(1)节点属性表示的选择困难;(2)分析和检测真实数据异常的实际证据不足;(3)在原始和注入的共访问数据之间进行节点行为的过滤具有挑战性。本文基于CUR分解和残差分析,研究了一种将属性信息和网络结构信息协同结合的离群节点统一检测框架。首先,利用关联规则构造共同访问图,并给出其节点的属性表示。然后,混合属性信息和网络结构信息,以识别可疑节点。与其他最先进的方法相比,在合成和现实数据集上进行的大量实验显示了所提出的检测方法的有效性。实验结果表明,该方法对共访问注入攻击的检测性能在虚警率(FAR)方面比基线提高了50%,同时保持了最高的检测率(DR)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信