Survey and Open Problems in Privacy Preserving Knowledge Graph: Merging, Query, Representation, Completion and Applications

• URL: http://arxiv.org/abs/2011.10180v1
• Date: Fri, 20 Nov 2020 02:35:47 GMT
• Title: Survey and Open Problems in Privacy Preserving Knowledge Graph: Merging, Query, Representation, Completion and Applications
• Authors: Chaochao Chen, Jamie Cui, Guanfeng Liu, Jia Wu, Li Wang
• Abstract summary: Knowledge Graph (KG) has attracted more and more companies' attention for its ability to connect different types of data in meaningful ways. However, the data isolation problem limits the performance of KG and prevents its further development. How to conduct privacy preserving KG becomes an important research question to answer.
• Score: 17.68925521011772
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Knowledge Graph (KG) has attracted more and more companies' attention for its ability to connect different types of data in meaningful ways and support rich data services. However, the data isolation problem limits the performance of KG and prevents its further development. That is, multiple parties have their own KGs but they cannot share with each other due to regulation or competition reasons. Therefore, how to conduct privacy preserving KG becomes an important research question to answer. That is, multiple parties conduct KG related tasks collaboratively on the basis of protecting the privacy of multiple KGs. To date, there is few work on solving the above KG isolation problem. In this paper, to fill this gap, we summarize the open problems for privacy preserving KG in data isolation setting and propose possible solutions for them. Specifically, we summarize the open problems in privacy preserving KG from four aspects, i.e., merging, query, representation, and completion. We present these problems in details and propose possible technical solutions for them. Moreover, we present three privacy preserving KG-aware applications and simply describe how can our proposed techniques be applied into these applications.

Related papers

• Question-Aware Knowledge Graph Prompting for Enhancing Large Language Models [51.47994645529258]
  We propose Question-Aware Knowledge Graph Prompting (QAP), which incorporates question embeddings into GNN aggregation to dynamically assess KG relevance. Experimental results demonstrate that QAP outperforms state-of-the-art methods across multiple datasets, highlighting its effectiveness.
  arXiv  Detail & Related papers  (2025-03-30T17:09:11Z)
• All Your Knowledge Belongs to Us: Stealing Knowledge Graphs via Reasoning APIs [7.685940197285116]
  We present KGX, an attack that extracts confidential sub-KGs with high fidelity under limited query budgets. We validate the efficacy of KGX against both experimental and real-world KGR APIs. Our findings suggest the need for a more principled approach to developing and deploying KGR systems.
  arXiv  Detail & Related papers  (2025-03-12T18:18:44Z)
• Decoding on Graphs: Faithful and Sound Reasoning on Knowledge Graphs through Generation of Well-Formed Chains [66.55612528039894]
  Knowledge Graphs (KGs) can serve as reliable knowledge sources for question answering (QA) We present DoG (Decoding on Graphs), a novel framework that facilitates a deep synergy between LLMs and KGs. Experiments across various KGQA tasks with different background KGs demonstrate that DoG achieves superior and robust performance.
  arXiv  Detail & Related papers  (2024-10-24T04:01:40Z)
• Uncertainty Management in the Construction of Knowledge Graphs: a Survey [3.5639148953570845]
  Knowledge Graphs (KGs) are a major asset for companies thanks to their great flexibility in data representation. To build a KG it is a common practice to rely on automatic methods for extracting knowledge from various heterogeneous sources. In a noisy and uncertain world, knowledge may not be reliable and conflicts between data sources may occur.
  arXiv  Detail & Related papers  (2024-05-27T08:22:52Z)
• Generate-on-Graph: Treat LLM as both Agent and KG in Incomplete Knowledge Graph Question Answering [87.67177556994525]
  We propose a training-free method called Generate-on-Graph (GoG) to generate new factual triples while exploring Knowledge Graphs (KGs) GoG performs reasoning through a Thinking-Searching-Generating framework, which treats LLM as both Agent and KG in IKGQA.
  arXiv  Detail & Related papers  (2024-04-23T04:47:22Z)
• Federated Knowledge Graph Completion via Latent Embedding Sharing and Tensor Factorization [51.286715478399515]
  Federated Latent Embedding factorization (FLEST) is a novel approach using federated factorization for KG completion. FLEST decomposes the embedding matrix and enables sharing of latent dictionary embeddings to lower privacy risks. Empirical results demonstrate FLEST's effectiveness and efficiency, offering a balanced solution between performance and privacy.
  arXiv  Detail & Related papers  (2023-11-17T06:03:56Z)
• Collective Knowledge Graph Completion with Mutual Knowledge Distillation [11.922522192224145]
  We study the problem of multi-KG completion, where we focus on maximizing the collective knowledge from different KGs. We propose a novel method called CKGC-CKD that uses relation-aware graph convolutional network encoder models on both individual KGs and a large fused KG. Experimental results on multilingual datasets have shown that our method outperforms all state-of-the-art models in the KGC task.
  arXiv  Detail & Related papers  (2023-05-25T09:49:40Z)
• Knowledge Graphs Querying [4.548471481431569]
  We aim at uniting different interdisciplinary topics and concepts that have been developed for KG querying. Recent advances on KG and query embedding, multimodal KG, and KG-QA come from deep learning, IR, NLP, and computer vision domains.
  arXiv  Detail & Related papers  (2023-05-23T19:32:42Z)
• Construction and Applications of Billion-Scale Pre-Trained Multimodal Business Knowledge Graph [64.42060648398743]
  We introduce the process of building an open business knowledge graph (OpenBG) derived from a well-known enterprise, Alibaba Group. OpenBG is an open business KG of unprecedented scale: 2.6 billion triples with more than 88 million entities covering over 1 million core classes/concepts and 2,681 types of relations.
  arXiv  Detail & Related papers  (2022-09-30T04:03:26Z)
• Reasoning over Multi-view Knowledge Graphs [59.99051368907095]
  ROMA is a novel framework for answering logical queries over multi-view KGs. It scales up to KGs of large sizes (e.g., millions of facts) and fine-granular views. It generalizes to query structures and KG views that are unobserved during training.
  arXiv  Detail & Related papers  (2022-09-27T21:32:20Z)
• Collaborative Knowledge Graph Fusion by Exploiting the Open Corpus [59.20235923987045]
  It is challenging to enrich a Knowledge Graph with newly harvested triples while maintaining the quality of the knowledge representation. This paper proposes a system to refine a KG using information harvested from an additional corpus.
  arXiv  Detail & Related papers  (2022-06-15T12:16:10Z)
• FedE: Embedding Knowledge Graphs in Federated Setting [21.022513922373207]
  Multi-Source KG is a common situation in real Knowledge Graph applications. 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. We propose a Federated Knowledge Graph Embedding framework FedE, focusing on learning knowledge graph embeddings by aggregating locally-computed updates.
  arXiv  Detail & Related papers  (2020-10-24T11:52:05Z)
• Multilingual Knowledge Graph Completion via Ensemble Knowledge Transfer [43.453915033312114]
  Predicting missing facts in a knowledge graph (KG) is a crucial task in knowledge base construction and reasoning. We propose KEnS, a novel framework for embedding learning and ensemble knowledge transfer across a number of language-specific KGs. Experiments on five real-world language-specific KGs show that KEnS consistently improves state-of-the-art methods on KG completion.
  arXiv  Detail & Related papers  (2020-10-07T04:54:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.