Towards Loosely-Coupling Knowledge Graph Embeddings and Ontology-based Reasoning

• URL: http://arxiv.org/abs/2202.03173v1
• Date: Mon, 7 Feb 2022 14:01:49 GMT
• Title: Towards Loosely-Coupling Knowledge Graph Embeddings and Ontology-based Reasoning
• Authors: Zoi Kaoudi and Abelardo Carlos Martinez Lorenzo and Volker Markl
• Abstract summary: We propose to loosely-couple the data-driven power of knowledge graph embeddings with domain-specific reasoning stemming from experts or entailment regimes (e.g., OWL2) Our initial results show that we enhance the MRR accuracy of vanilla knowledge graph embeddings by up to 3x and outperform hybrid solutions that combine knowledge graph embeddings with rule mining and reasoning up to 3.5x MRR.
• Score: 15.703028753526022
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Knowledge graph completion (a.k.a.~link prediction), i.e.,~the task of inferring missing information from knowledge graphs, is a widely used task in many applications, such as product recommendation and question answering. The state-of-the-art approaches of knowledge graph embeddings and/or rule mining and reasoning are data-driven and, thus, solely based on the information the input knowledge graph contains. This leads to unsatisfactory prediction results which make such solutions inapplicable to crucial domains such as healthcare. To further enhance the accuracy of knowledge graph completion we propose to loosely-couple the data-driven power of knowledge graph embeddings with domain-specific reasoning stemming from experts or entailment regimes (e.g., OWL2). In this way, we not only enhance the prediction accuracy with domain knowledge that may not be included in the input knowledge graph but also allow users to plugin their own knowledge graph embedding and reasoning method. Our initial results show that we enhance the MRR accuracy of vanilla knowledge graph embeddings by up to 3x and outperform hybrid solutions that combine knowledge graph embeddings with rule mining and reasoning up to 3.5x MRR.

Related papers

• Question-guided Knowledge Graph Re-scoring and Injection for Knowledge Graph Question Answering [27.414670144354453]
  KGQA involves answering natural language questions by leveraging structured information stored in a knowledge graph. We propose a Question-guided Knowledge Graph Re-scoring method (Q-KGR) to eliminate noisy pathways for the input question. We also introduce Knowformer, a parameter-efficient method for injecting the re-scored knowledge graph into large language models to enhance their ability to perform factual reasoning.
  arXiv  Detail & Related papers  (2024-10-02T10:27:07Z)
• Graph Domain Adaptation: Challenges, Progress and Prospects [61.9048172631524]
  We propose graph domain adaptation as an effective knowledge-transfer paradigm across graphs. GDA introduces a bunch of task-related graphs as source graphs and adapts the knowledge learnt from source graphs to the target graphs. We outline the research status and challenges, propose a taxonomy, introduce the details of representative works, and discuss the prospects.
  arXiv  Detail & Related papers  (2024-02-01T02:44:32Z)
• A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and Future Directions [64.84521350148513]
  Graphs represent interconnected structures prevalent in a myriad of real-world scenarios. Effective graph analytics, such as graph learning methods, enables users to gain profound insights from graph data. However, these methods often suffer from data imbalance, a common issue in graph data where certain segments possess abundant data while others are scarce. This necessitates the emerging field of imbalanced learning on graphs, which aims to correct these data distribution skews for more accurate and representative learning outcomes.
  arXiv  Detail & Related papers  (2023-08-26T09:11:44Z)
• KGrEaT: A Framework to Evaluate Knowledge Graphs via Downstream Tasks [1.8722948221596285]
  KGrEaT is a framework to estimate the quality of knowledge graphs via actual downstream tasks like classification, clustering, or recommendation. The framework takes a knowledge graph as input, automatically maps it to the datasets to be evaluated on, and computes performance metrics for the defined tasks.
  arXiv  Detail & Related papers  (2023-08-21T07:43:10Z)
• State of the Art and Potentialities of Graph-level Learning [54.68482109186052]
  Graph-level learning has been applied to many tasks including comparison, regression, classification, and more. Traditional approaches to learning a set of graphs rely on hand-crafted features, such as substructures. Deep learning has helped graph-level learning adapt to the growing scale of graphs by extracting features automatically and encoding graphs into low-dimensional representations.
  arXiv  Detail & Related papers  (2023-01-14T09:15:49Z)
• Leveraging Wikidata's edit history in knowledge graph refinement tasks [77.34726150561087]
  edit history represents the process in which the community reaches some kind of fuzzy and distributed consensus. We build a dataset containing the edit history of every instance from the 100 most important classes in Wikidata. We propose and evaluate two new methods to leverage this edit history information in knowledge graph embedding models for type prediction tasks.
  arXiv  Detail & Related papers  (2022-10-27T14:32:45Z)
• Conditional Attention Networks for Distilling Knowledge Graphs in Recommendation [74.14009444678031]
  We propose Knowledge-aware Conditional Attention Networks (KCAN) to incorporate knowledge graph into a recommender system. We use a knowledge-aware attention propagation manner to obtain the node representation first, which captures the global semantic similarity on the user-item network and the knowledge graph. Then, by applying a conditional attention aggregation on the subgraph, we refine the knowledge graph to obtain target-specific node representations.
  arXiv  Detail & Related papers  (2021-11-03T09:40:43Z)
• Knowledge Sheaves: A Sheaf-Theoretic Framework for Knowledge Graph Embedding [1.5469452301122175]
  We show that knowledge graph embedding is naturally expressed in the topological and categorical language of textitcellular sheaves A knowledge graph embedding can be described as an approximate global section of an appropriate textitknowledge sheaf over the graph. The resulting embeddings can be easily adapted for reasoning over composite relations without special training.
  arXiv  Detail & Related papers  (2021-10-07T20:54:40Z)
• Graphing else matters: exploiting aspect opinions and ratings in explainable graph-based recommendations [66.83527496838937]
  We propose to exploit embeddings extracted from graphs that combine information from ratings and aspect-based opinions expressed in textual reviews. We then adapt and evaluate state-of-the-art graph embedding techniques over graphs generated from Amazon and Yelp reviews on six domains. Our approach has the advantage of providing explanations which leverage aspect-based opinions given by users about recommended items.
  arXiv  Detail & Related papers  (2021-07-07T13:57:28Z)
• Knowledge Graphs [43.06435841693428]
  We motivate and contrast various graph-based data models and query languages that are used for knowledge graphs. We explain how knowledge can be represented and extracted using a combination of deductive and inductive techniques. We conclude with high-level future research directions for knowledge graphs.
  arXiv  Detail & Related papers  (2020-03-04T20:20:32Z)

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.