VLDB 2026 Research / reviewers in the wild / expert
Zihong Xian
dblp:434/1804
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0008-0168-6792ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
federated recommendation |
1.0 | 1 | 2026 | FedHoG: Federated Homogeneous Graph Neural Network for Privacy-Preserving Recommendation · ACM Trans. Inf. Syst. 2026 |
Recommender systems › graph-based recommendation
graph neural network recommendation |
1.0 | 1 | 2026 | FedHoG: Federated Homogeneous Graph Neural Network for Privacy-Preserving Recommendation · ACM Trans. Inf. Syst. 2026 |
Recommender systems › trustworthy recommendation
privacy-preserving recommendation |
1.0 | 1 | 2026 | FedHoG: Federated Homogeneous Graph Neural Network for Privacy-Preserving Recommendation · ACM Trans. Inf. Syst. 2026 |
Methods — techniques the papers use, named apart from their topics
graph embedding · 1.0graph convolution · 1.0federated learning · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | FedHoG: Federated Homogeneous Graph Neural Network for Privacy-Preserving RecommendationabstractMost 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 . Zihong Xian, Enyue Yang, Weike Pan, Zhong Ming 0001 |
ACM Trans. Inf. Syst. | 1 |