论文标题
Fede:将知识图嵌入联合环境中
FedE: Embedding Knowledge Graphs in Federated Setting
论文作者
论文摘要
由三元组组成的知识图(kgs)总是不完整的,因此通过预测缺失的三元组来完成知识图完成(KGC)很重要。多源kg是真正的kg应用中的常见情况,可以将其视为一组相关的单个kg,其中不同的kg包含了实体不同方面的关系。直观的是,对于每个kg而言,它的完成可能会由其他三个三元组为其他三元组所造成的贡献。但是,由于数据隐私和敏感性,一组相关的知识图无法通过将数据从不同的知识图中收集在一起来补充彼此的KGC。因此,在本文中,我们引入联合设置,以保持其隐私,而无需在kg之间进行三重转移,并将其应用于嵌入知识图,这是一种典型的方法,在过去十年中对kgc有效。我们提出了一个联合知识图嵌入框架FEDE,通过汇总本地计算的更新来重点放在学习知识图嵌入式上。最后,我们对来自KGE基准数据集的数据集进行了广泛的实验,结果显示了我们提出的FEDE的有效性。
Knowledge graphs (KGs) consisting of triples are always incomplete, so it's important to do Knowledge Graph Completion (KGC) by predicting missing triples. Multi-Source KG is a common situation in real KG applications which can be viewed as a set of related individual KGs where different KGs contains relations of different aspects of entities. It's intuitive that, for each individual KG, its completion could be greatly contributed by the triples defined and labeled in other ones. However, because of the data privacy and sensitivity, a set of relevant knowledge graphs cannot complement each other's KGC by just collecting data from different knowledge graphs together. Therefore, in this paper, we introduce federated setting to keep their privacy without triple transferring between KGs and apply it in embedding knowledge graph, a typical method which have proven effective for KGC in the past decade. We propose a Federated Knowledge Graph Embedding framework FedE, focusing on learning knowledge graph embeddings by aggregating locally-computed updates. Finally, we conduct extensive experiments on datasets derived from KGE benchmark datasets and results show the effectiveness of our proposed FedE.