Skip to content
Open access

Privacy-Preserving Peer-to-Peer Cross-Domain Collaborative Filtering via Intent-Adaptive Graph Reconstruction

Jul 2026 · Electronics · Vol 15, pp. 3121 · 0 citations · 19 references

TL;DR

P2P-IAGR, a privacy-preserving peer-to-peer cross-domain collaborative filtering framework based on intent-adaptive graph reconstruction, is proposed, which significantly outperforms state-of-the-art methods.

Abstract

Cross-domain collaborative filtering effectively alleviates the data sparsity issue but raises serious privacy concerns. Federated learning has been integrated into cross-domain collaborative filtering to reduce these risks by securely exchanging embeddings or model parameters. However, the current federated paradigm often relies on the simple alignment of coarse-grained representations, while propagating information on a rigid local graph. Without fine-grained preference modeling, models easily suffer from representation collapse. The inherent sparsity of local graphs further limits their robustness. To address these issues, we propose P2P-IAGR, a privacy-preserving peer-to-peer cross-domain collaborative filtering framework based on intent-adaptive graph reconstruction. Specifically, our framework first disentangles user and item representations into fine-grained latent intent prototypes. We perturb these prototypes using Local Differential Privacy (LDP) and securely exchange them across domains. A contrastive learning strategy is then used for cross-domain alignment. Next, guided by the combined cross-domain intent prior, P2P-IAGR differentiably reconstructs an augmented graph view. We apply a dual-view structural contrastive learning objective to dynamically inject external collaborative signals into the sparse local topology. Extensive experiments on real-world datasets show that P2P-IAGR significantly outperforms state-of-the-art methods, achieving an average improvement of 5.85% in NDCG and 6.89% in HR.

Read PDF

Similar papers

Conference Open access Sep 2026

FedFINFO: A General Full-Informativeness Federated Graph Learning from Open Cross-Domain Data

This work proposes a counterfactual multi-view framework to explicitly learn a structure masker for extracting consensus subgraphs and proposes a history-aware adaptive multi-channel aggregation mechanism to enable dynamic and personalized sharing driven by channel similarity while preventing collaborative oscillation.

Wan Zhang, Xiao-Qian Jiang, Ye Wang et al. · 0 citations
Conference Open access Apr 2026

CAT-LDP: Cloud-Edge Adaptive Taxonomy Under Local Differential Privacy

The results show that combining category-space modeling with cloud-local task decoupling can effectively reduce noise amplification in long-tail sparse settings and provide a better balance between privacy and utility for implicit-feedback recommendation.

Jun-Zhe Yang, Chang Xia, Xi-Yun Wang et al. · 0 citations
Preprint Aug 2026

FedCGR: Federated Cross-Domain Generative Recommendation

FedCGR is proposed, a federated generative CDR framework that keeps the item language stable and makes adaptation explicit and consistently outperforms federated generative baselines and achieves competitive performance against strong sequential and federated CDR methods under both full-ranking and sampled evaluation p...

Zhuo-Dong Liu, Hugen Lv, Xiang-Yu Li et al. · 0 citations
Open access Aug 2026

HGAT-Rec: a hierarchical graph attention framework for cross-domain e-commerce recommendation with heterogeneity-aware contrastive alignment

HGAT-Rec is proposed, which incorporates a heterogeneity-aware contrastive learning (HCL) objective that grounds view construction and sample selection in the typed relational structure of a cross-domain heterogeneous graph: type-stratified edge dropout preserves high-signal interaction channels proportionally to their...

Rui Zhang, YaTing Zhao, FengBo Wang et al. · 0 citations
Open access Sep 2026

Locally differentially private graph clustering via structure-preserving graph compression

Locally differentially private clustering is an effective approach to uncover latent structures in decentralized social graphs while preserving individual privacy. Existing solutions encode graph data using adjacency bit vectors, whose high dimensionality introduces substantial differential noise and consequently degra...

Dong-Yue Zhang, Wei-Wei Ni, Nan Fu et al. · 0 citations
2026

Achieving Prior-Aligned Utility-Privacy Trade-Off for Data Sharing

In privacy-aware data sharing, achieving a prior-aligned trade-off between task utility and sensitive information leakage remains a critical and challenging problem. Conventional approaches typically adopt coarse-grained feature selection strategies, often sharing all attributes or fixed subsets without fine differenti...

Xue Chen, Cheng Wang, Changjun Jiang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.