A Federated Multi-Server Knowledge Graph Embedding Framework For Link Prediction

The federated framework is actively applied in knowledge graph fusion research to obtain a complete knowledge graph without exposing data privacy. It can help local clients learn the knowledge graph embeddings in other clients without revealing data privacy. However, current federated-based knowledge graph embedding frameworks cannot exploit both entity and relation embeddings and may not prevent partial triples from being reconstructed. This paper proposes a novel framework named Federated Multi-server knowledge graph embedding (FedM), which creatively utilizes uploaded entity and relation embeddings while preventing privacy leakage. Expressly, we first set up two central servers for entity and relation embeddings to aggregate and share client-uploaded embeddings. Secondly, we design a knowledge graph secure aggregation algorithm to address the potential privacy concerns in FedM. We conduct comparative experiments on an empirical dataset (divided into three federated datasets) with four commonly-used knowledge graph embedding methods to evaluate the performance of our proposed framework. In addition, our proposed FedM framework is generally superior to the latest baseline frameworks on both privacy preservation and link prediction tasks.