Knowledge-enhanced Black-box Attacks for Recommendations
Open accessAbstract
Recent studies have shown that deep neural networks-based recommender systems are vulnerable to adversarial attacks, where attackers can inject carefully crafted fake user profiles (i.e., a set of items that fake users have interacted with) into a target recommender system to achieve malicious purposes, such as promote or demote a set of target items. Due to the security and privacy concerns, it is more practical to perform adversarial attacks under the black-box setting, where the architecture/parameters and training data of target systems cannot be easily accessed by attackers. However, generating high-quality fake user profiles under black-box setting is rather challenging with limited resources to target systems. To address this challenge, in this work, we introduce a novel strategy by leveraging items' attribute information (i.e., items' knowledge graph), which can be publicly accessible and provide rich auxiliary knowledge to enhance the generation of fake user profiles. More specifically, we propose a knowledge graph-enhanced black-box attacking framework (KGAttack) to effectively learn attacking policies through deep reinforcement learning techniques, in which knowledge graph is seamlessly integrated into hierarchical policy networks to generate fake user profiles for performing adversarial black-box attacks. Comprehensive experiments on various real-world datasets demonstrate the effectiveness of the proposed attacking framework under the black-box setting.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Attacks on recommender systems can be classified based on the adversary's knowledge level into black, grey, or white box attacks.
“Attacks can be classified based on the adversary's knowledge level into black, grey, or white box attacks [89-94].”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [91]
Deep neural network (DNN) model-based RS, such as recurrent neural networks (RNNs) and graph neural networks (GNNs), are particularly susceptible to these attacks since minor, unnoticeable changes in input data can significantly alter the output results.
“Deep neural network (DNN) model-based RS, such as recurrent neural networks (RNNs) and graph neural networks (GNNs), are particularly susceptible to these attacks since minor, unnoticeable changes in input data can significantly alter the output results [89, 91, 114].”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [91]
To achieve this, adversaries typically employ a min-max game strategy to facilitate adversarial learning through the use of generative adversarial networks (GANs), knowledge graph networks, or reinforcement learning techniques.
“To achieve this, adversaries typically employ a min-max game strategy to facilitate adversarial learning through the use of generative adversarial networks (GANs), knowledge graph networks, or reinforcement learning techniques [89, 91, 115].”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [91]
Cites
Adversarial attacks on an oblivious recommender
Christakopoulou, K., & Banerjee, A. (2019) · Proceedings of the 13th ACM Conference on Recommender Systems · doi:10.1145/3298689.3347031 · Cited by 105 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
A Survey on RAG Meeting LLMs: Towards Retrieval-Augmented Large Language Models
Fan, W., Ding, Y., Ning, L., Wang, S., Li, H., Yin, D., Chua, T.-S., & Li, Q. (2024) · Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining · doi:10.1145/3637528.3671470 · Cited by 827 · see citing works
Self-citationRoy, F., Ding, X., Choo, K. K. R., & Zhou, P. (2024) · arXiv · doi:10.48550/arxiv.2409.12651
- Authors
- Chen, J., Fan, W., Zhu, G., Zhao, X., Yuan, C., Li, Q., & Huang, Y.
- Affiliations
- Nanjing University (CN)
- Hong Kong Polytechnic University (HK)
- City University of Hong Kong (HK)
- Venue
- Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
- Publisher
- ACM
- Published
- 2022-08-14
- Pages
- 108-117
- OpenAlex
- W4286750695
- Cited by
- 49
- References
- 1
- Citations by year
- 2026: 7 · 2025: 7 · 2024: 23 · 2023: 11 · 2022: 1
- FWCI
- 9.39
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- General Research Fund from the Hong Kong Research Grants Council (PolyU 15200021)
- APRC - CityU New Research Initiatives (9610565)
- SIRG - CityU Strategic Interdisciplinary Research Grant (7020046;7020074)
- Natural Science Foundation of Jiangsu Province (BK20210181)
- CCF-Tencent Open Fund
- National Natural Science Foundation of China (62102335;62102177;U1811461)
- Key Research and Development Program of Jiangsu Province (BE2021729)
- Open Research Projects of Zhejiang Lab (2022PG0AB07)
- Topics
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Keywords
- black-box attacks, adversarial attacks, recommender systems, fake accounts, knowledge graphs, deep reinforcement learning, item characteristics, deep neural network security
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review