Scholarlink

<p>Graph-structured data plays a critical role in high-stakes applications such as financial fraud detection and medical diagnosis. However, the non-Euclidean topology and inherent privacy sensitivity of graph data make it difficult for traditional federated learning (FL) to effectively balance model performance and privacy protection. We present FedHGPP (Federated Heterogeneous Graph Privacy Protection), a two-phase semantic fusion framework that enables privacy-preserving collaborative graph learning across institutional data silos. The FedHGPP framework employs a two-phase differential privacy perturbation mechanism (DPRR+EM) in the local preprocessing step, injecting calibrated noise into high-order structural statistics of the original graph. We allocate the total privacy budget strictly following the sequential composition theorem of differential privacy, ensuring rigorous edge-level <InlineEquation ID="IEq1"><EquationSource Format="TEX">\(\varepsilon \)</EquationSource><EquationSource Format="MATHML"><math><mi>ε</mi></math></EquationSource></InlineEquation>-DP guarantees for the framework. During federated training, clients upload homomorphically encrypted node embeddings, while the server performs secure cross-graph attention aggregation in the ciphertext domain to prevent leakage of intermediate representations. Experiments on three real-world datasets show that under edge-level <InlineEquation ID="IEq2"><EquationSource Format="TEX">\(\varepsilon \)</EquationSource><EquationSource Format="MATHML"><math><mi>ε</mi></math></EquationSource></InlineEquation>-DP constraints (<InlineEquation ID="IEq3"><EquationSource Format="TEX">\(\varepsilon \)</EquationSource><EquationSource Format="MATHML"><math><mi>ε</mi></math></EquationSource></InlineEquation>=2.0), FedHGPP achieves an average HR@10 of 0.476 and NDCG@10 of 0.254. It outperforms state-of-the-art federated heterogeneous graph learning methods with formal privacy guarantees on all tested datasets, narrowing the average performance gap with the privacy-free centralized upper bound (Central-HAN) to below 13&#xa0;% for NDCG@10 and within 10&#xa0;% for HR@10.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A two-phase semantic fusion framework for privacy-preserving federated heterogeneous graph learning

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年4月20日

查看全文
  • Qi Li,
  • Ligang Wang,
  • Ningning Luo

摘要

Graph-structured data plays a critical role in high-stakes applications such as financial fraud detection and medical diagnosis. However, the non-Euclidean topology and inherent privacy sensitivity of graph data make it difficult for traditional federated learning (FL) to effectively balance model performance and privacy protection. We present FedHGPP (Federated Heterogeneous Graph Privacy Protection), a two-phase semantic fusion framework that enables privacy-preserving collaborative graph learning across institutional data silos. The FedHGPP framework employs a two-phase differential privacy perturbation mechanism (DPRR+EM) in the local preprocessing step, injecting calibrated noise into high-order structural statistics of the original graph. We allocate the total privacy budget strictly following the sequential composition theorem of differential privacy, ensuring rigorous edge-level \(\varepsilon \)ε-DP guarantees for the framework. During federated training, clients upload homomorphically encrypted node embeddings, while the server performs secure cross-graph attention aggregation in the ciphertext domain to prevent leakage of intermediate representations. Experiments on three real-world datasets show that under edge-level \(\varepsilon \)ε-DP constraints (\(\varepsilon \)ε=2.0), FedHGPP achieves an average HR@10 of 0.476 and NDCG@10 of 0.254. It outperforms state-of-the-art federated heterogeneous graph learning methods with formal privacy guarantees on all tested datasets, narrowing the average performance gap with the privacy-free centralized upper bound (Central-HAN) to below 13 % for NDCG@10 and within 10 % for HR@10.