FedHoG: Federated Homogeneous Graph Neural Network for Privacy-Preserving Recommendation

Zihong Xian et al.

ACM Transactions on Information Systems2026https://doi.org/10.1145/3787468article
ABDC C
Weight
0.50

What the paper says

Most existing GNN-based recommendation methods focus on exploiting a user–item heterogeneous graph, which, however, will cause efficiency and effectiveness challenges, in a federated learning setting considering user privacy. We find that a user–user or item–item homogeneous graph is often privacy-insensitive and can significantly enhance the efficiency and effectiveness of federated graph embedding learning. Hence, we propose a novel framework called Federated Homogeneous Graph Neural Network (FedHoG) , which can provide privacy-preserving recommendations with high-quality and communication-efficient graph learning. We first design a privacy-preserving homogeneous graph construction method, which enables the server to construct an item–item graph and a user–user graph without leaking user privacy. Then, we develop a federated homogeneous graph learning method that enables balanced GNN model training among the server and clients. We also propose a lightweight homogeneous graph convolution method to achieve better graph embedding learning. Finally, extensive experiments on three public datasets show the advantages of our FedHoG in performance and efficiency. The datasets, source codes, and scripts are available at https://github.com/XZHhong/FedHoG .

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1145/3787468

Or copy a formatted citation

@article{zihong2026,
  title        = {{FedHoG: Federated Homogeneous Graph Neural Network for Privacy-Preserving Recommendation}},
  author       = {Zihong Xian et al.},
  journal      = {ACM Transactions on Information Systems},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1145/3787468},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

FedHoG: Federated Homogeneous Graph Neural Network for Privacy-Preserving Recommendation

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.