Differentially Private Sparse Mapping for Privacy-Preserving Cross Domain Recommendation
Weiming Liu, Xiaolin Zheng, Chaochao Chen, Mengling Hu, Xinting Liao, Fan Wang, Yanchao Tan, Dan Meng, Jun Wang
Abstract
Cross-Domain Recommendation (CDR) has been popularly studied for solving the data sparsity problem via leveraging rich knowledge from the auxiliary domain. Most of the current CDR models assume that user-item ratings/reviews are both accessible during the training procedure. However, it is impractical nowadays due to the strict data privacy protection policy. In this paper, we focus on the Privacy-Preserving Cross-Domain Recommendation problem (PPCDR). Although some previous approaches have investigated the problems, they always fail to effectively utilize the rating and review for user preference modeling. What is worse, they separate the processes of privacy data modeling and user-item collaborative filtering, leading to suboptimal solutions. To fill this gap, we propose the Differentially Private Sparse Mapping Recommendation model (DPSMRec), an end-to-end cross-domain recommendation framework for solving the PPCDR problem. DPSMRec includes three main modules, i.e., source embedding generation module, target rating prediction module, and differentially private sparse mapping module. Specifically, the source embedding generation module and target rating prediction module are set to exploit the ratings and review in each domain. The differentially private sparse mapping module aims to transfer knowledge among the overlapped users via Wasserstein distance privately. To obtain more accurate mapping solutions, we further propose differentially private enhanced sparse optimal transport via fused Gromov-Wasserstein distance which can consider both structure and semantic information among the users across domains. Our empirical study on Amazon and Douban datasets demonstrates that DPSMRec significantly outperforms the state-of-the-art models under the PPCDR setting.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Cited by top-tier papers6
- Federated Graph Learning for Cross-Domain RecommendationZiqi Yang, Zhaopeng Peng, Zihui Wang, Jianzhong Qi et al.NeurIPS 2024 · 24 citations
- TFGDA: Exploring Topology and Feature Alignment in Semi-supervised Graph Domain Adaptation through Robust ClusteringJun Dan, Weiming Liu, Chunfeng Xie, Hua Yu et al.NeurIPS 2024 · 22 citations
- Multi-Modal Recommendation Unlearning for Legal, Licensing, and Modality ConstraintsYash Sinha, Murari Mandal, Mohan S. KankanhalliAAAI 2025 · 5 citations
- Enhancing Healthcare Recommendations: A Privacy-Protective and Interpretable Cross-Domain FrameworkXun Liang, Zhiying Li, Hongxun JiangAAAI 2025 · 1 citation
- Rethinking the Representation in Federated Unsupervised Learning with Non-IID DataXinting Liao, Weiming Liu, Chaochao Chen, Pengyang Zhou et al.CVPR 2024
Related papers
- Reducing Item Discrepancy via Differentially Private Robust Embedding Alignment for Privacy-Preserving Cross Domain RecommendationWeiming Liu, Xiaolin Zheng, Chaochao Chen, Jiahe Xu et al.ICML 2024 · 5 citations
- Exploiting Variational Domain-Invariant User Embedding for Partially Overlapped Cross Domain RecommendationWeiming Liu, Xiaolin Zheng, Jiajie Su, Mengling Hu et al.SIGIR 2022 · 59 citations
- PPGenCDR: A Stable and Robust Framework for Privacy-Preserving Cross-Domain RecommendationXinting Liao, Weiming Liu, Xiaolin Zheng, Binhui Yao et al.AAAI 2023 · 28 citations
- Win-Win: A Privacy-Preserving Federated Framework for Dual-Target Cross-Domain RecommendationGaode Chen, Xinghua Zhang, Yijun Su, Yantong Lai et al.AAAI 2023 · 48 citations
- Learning Accurate and Bidirectional Transformation via Dynamic Embedding Transportation for Cross-Domain RecommendationWeiming Liu, Chaochao Chen, Xinting Liao, Mengling Hu et al.AAAI 2024 · 33 citations
