arXiv:2412.01141cs.IR2024-12被引 3

提出隐私保护的图卷积网络,实现无损推荐性能。

Lossless and Privacy-Preserving Graph Convolution Network for Federated Item Recommendation

  • 在分布式子图上完成完整图卷积,不依赖中心化数据
  • 实测性能与集中式模型相当,三个数据集均超越现有方法
  • 适合关注隐私安全的推荐系统研究者

图神经网络(GNN)已成为物品推荐的前沿方法。然而,现有基于GNN的推荐方法依赖于用户-物品交互子图的集中存储和全局图聚合训练,带来隐私风险。为此,部分研究采用去中心化的子图进行联邦推荐以保护隐私。但受隐私约束,现有联邦推荐方法的图卷积过程不完整,导致推荐性能下降。本文提出一种全新的无损且隐私保护的图卷积网络(LP-GCN),在保持分布式子图的前提下,完全实现图卷积过程,同时保障隐私。其性能与非联邦(即集中式)方法相当。通过理论分析与实证研究验证了有效性。在三个真实数据集上的大量实验表明,LP-GCN优于现有联邦推荐方法。代码将在论文接受后公开。

原文摘要 · Abstract (English)

Graph neural network (GNN) has emerged as a state-of-the-art solution for item recommendation. However, existing GNN-based recommendation methods rely on a centralized storage of fragmented user-item interaction sub-graphs and training on an aggregated global graph, which will lead to privacy concerns. As a response, some recent works develop GNN-based federated recommendation methods by exploiting decentralized and fragmented user-item sub-graphs in order to preserve user privacy. However, due to privacy constraints, the graph convolution process in existing federated recommendation methods is incomplete compared with the centralized counterpart, causing a degradation of the recommendation performance. In this paper, we propose a novel lossless and privacy-preserving graph convolution network (LP-GCN), which fully completes the graph convolution process with decentralized user-item interaction sub-graphs while ensuring privacy. It is worth mentioning that its performance is equivalent to that of the non-federated (i.e., centralized) counterpart. Moreover, we validate its effectiveness through both theoretical analysis and empirical studies. Extensive experiments on three real-world datasets show that our LP-GCN outperforms the existing federated recommendation methods. The code will be publicly available once the paper is accepted.

联邦学习图神经网络推荐系统隐私保护

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。