Multi-Agent Attacks for Black-Box Social Recommendations

被引:0
作者
Wang, Shijie [1 ]
Fan, Wenqi [1 ]
Wei, Xiao-yong [1 ]
Mei, Xiaowei [1 ]
Lin, Shanru [2 ]
Li, Qing [1 ]
机构
[1] Hong Kong Polytech Univ, Hong Kong, Peoples R China
[2] City Univ Hong Kong, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Social Recommendations; Adversarial Attacks; Multi-agent Reinforcement Learning; Recommender Systems; Graph Neural Networks; Black-box Attacks;
D O I
10.1145/3696105
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The rise of online social networks has facilitated the evolution of social recommender systems, which incorporate social relations to enhance users' decision-making process. With the great success of Graph Neural Networks (GNNs) in learning node representations, GNN-based social recommendations have been widely studied to model user-item interactions and user-user social relations simultaneously. Despite their great successes, recent studies have shown that these advanced recommender systems are highly vulnerable to adversarial attacks, in which attackers can inject well-designed fake user profiles to disrupt recommendation performances. While most existing studies mainly focus on targeted attacks to promote target items on vanilla recommender systems, untargeted attacks to degrade the overall prediction performance are less explored on social recommendations under a black-box scenario. To perform untargeted attacks on social recommender systems, attackers can construct malicious social relationships for fake users to enhance the attack performance. However, the coordination of social relations and item profiles is challenging for attacking black-box social recommendations. To address this limitation, we first conduct several preliminary studies to demonstrate the effectiveness of cross-community connections and cold-start items in degrading recommendations performance. Specifically, we propose a novel framework MultiAttack based on multi-agent reinforcement learning to coordinate the generation of cold-start item profiles and cross-community social relations for conducting untargeted attacks on black-box social recommendations. Comprehensive experiments on various real-world datasets demonstrate the effectiveness of our proposed attacking framework under the black-box setting.
引用
收藏
页数:26
相关论文
共 64 条
  • [1] Controlling Popularity Bias in Learning-to-Rank Recommendation
    Abdollahpouri, Himan
    Burke, Robin
    Mobasher, Bamshad
    [J]. PROCEEDINGS OF THE ELEVENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'17), 2017, : 42 - 46
  • [2] Graph based anomaly detection and description: a survey
    Akoglu, Leman
    Tong, Hanghang
    Koutra, Danai
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2015, 29 (03) : 626 - 688
  • [3] The Exploration-Exploitation Trade-off in Interactive Recommender Systems
    Barraza-Urbina, Andrea
    [J]. PROCEEDINGS OF THE ELEVENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'17), 2017, : 431 - 435
  • [4] Fast unfolding of communities in large networks
    Blondel, Vincent D.
    Guillaume, Jean-Loup
    Lambiotte, Renaud
    Lefebvre, Etienne
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
  • [5] LOF: Identifying density-based local outliers
    Breunig, MM
    Kriegel, HP
    Ng, RT
    Sander, J
    [J]. SIGMOD RECORD, 2000, 29 (02) : 93 - 104
  • [6] Goodbye Pareto Principle, Hello Long Tail: The Effect of Search Costs on the Concentration of Product Sales
    Brynjolfsson, Erik
    Hu, Yu
    Simester, Duncan
    [J]. MANAGEMENT SCIENCE, 2011, 57 (08) : 1373 - 1386
  • [7] Burke, 2005, P 3 INT WORKSH INT T, P17
  • [8] Segment-based injection attacks against collaborative filtering recommender systems
    Burke, R
    Mobasher, B
    Bhaumik, R
    Williams, C
    [J]. Fifth IEEE International Conference on Data Mining, Proceedings, 2005, : 577 - 580
  • [9] Busoniu L, 2010, STUD COMPUT INTELL, V310, P183
  • [10] Celma O, 2008, RECSYS'08: PROCEEDINGS OF THE 2008 ACM CONFERENCE ON RECOMMENDER SYSTEMS, P179