Improving rule mining via embedding-based link prediction

• URL: http://arxiv.org/abs/2406.10144v1
• Date: Fri, 14 Jun 2024 15:53:30 GMT
• Title: Improving rule mining via embedding-based link prediction
• Authors: N'Dah Jean Kouagou, Arif Yilmaz, Michel Dumontier, Axel-Cyrille Ngonga Ngomo,
• Abstract summary: Rule mining on knowledge graphs allows for explainable link prediction. Several approaches combining the two families have been proposed in recent years. We propose a new way to combine the two families of approaches.
• Score: 2.422410293747519
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Rule mining on knowledge graphs allows for explainable link prediction. Contrarily, embedding-based methods for link prediction are well known for their generalization capabilities, but their predictions are not interpretable. Several approaches combining the two families have been proposed in recent years. The majority of the resulting hybrid approaches are usually trained within a unified learning framework, which often leads to convergence issues due to the complexity of the learning task. In this work, we propose a new way to combine the two families of approaches. Specifically, we enrich a given knowledge graph by means of its pre-trained entity and relation embeddings before applying rule mining systems on the enriched knowledge graph. To validate our approach, we conduct extensive experiments on seven benchmark datasets. An analysis of the results generated by our approach suggests that we discover new valuable rules on the enriched graphs. We provide an open source implementation of our approach as well as pretrained models and datasets at https://github.com/Jean-KOUAGOU/EnhancedRuleLearning

Related papers

• PageRank Bandits for Link Prediction [72.61386754332776]
  Link prediction is a critical problem in graph learning with broad applications such as recommender systems and knowledge graph completion. This paper reformulates link prediction as a sequential decision-making process, where each link prediction interaction occurs sequentially. We propose a novel fusion algorithm, PRB (PageRank Bandits), which is the first to combine contextual bandits with PageRank for collaborative exploitation and exploration.
  arXiv  Detail & Related papers  (2024-11-03T02:39:28Z)
• HybridFC: A Hybrid Fact-Checking Approach for Knowledge Graphs [2.2724158483142363]
  We consider fact-checking approaches that aim to predict the veracity of assertions in knowledge graphs. We propose a hybrid approach -- dubbed HybridFC -- that exploits the diversity of existing categories of fact-checking approaches. Our approach outperforms the state of the art by 0.14 to 0.27 in terms of Area Under the Receiver Operating Characteristic curve on the FactBench dataset.
  arXiv  Detail & Related papers  (2024-09-10T17:55:00Z)
• LinkLogic: A New Method and Benchmark for Explainable Knowledge Graph Predictions [0.5999777817331317]
  We present an in-depth exploration of a simple link prediction explanation method we call LinkLogic. We construct the first-ever link prediction explanation benchmark, based on family structures present in the FB13 dataset.
  arXiv  Detail & Related papers  (2024-06-02T20:22:22Z)
• You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction [79.15394378571132]
  We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph. The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge. We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
  arXiv  Detail & Related papers  (2023-02-27T22:56:06Z)
• Towards Loosely-Coupling Knowledge Graph Embeddings and Ontology-based Reasoning [15.703028753526022]
  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.
  arXiv  Detail & Related papers  (2022-02-07T14:01:49Z)
• Transformation of Node to Knowledge Graph Embeddings for Faster Link Prediction in Social Networks [2.458658951393896]
  Recent advances in neural networks have solved common graph problems such as link prediction, node classification, node clustering, node recommendation. In this work, we investigate a transformation model which converts node embeddings obtained from random walk based methods to embeddings obtained from knowledge graph methods directly without an increase in the computational cost.
  arXiv  Detail & Related papers  (2021-11-17T04:57:41Z)
• KGRefiner: Knowledge Graph Refinement for Improving Accuracy of Translational Link Prediction Methods [4.726777092009553]
  This paper proposes a method for refining the knowledge graph. It makes the knowledge graph more informative, and link prediction operations can be performed more accurately. Our experiments show that our method can significantly increase the performance of translational link prediction methods.
  arXiv  Detail & Related papers  (2021-06-27T13:32:39Z)
• Graph Learning based Recommender Systems: A Review [111.43249652335555]
  Graph Learning based Recommender Systems (GLRS) employ advanced graph learning approaches to model users' preferences and intentions as well as items' characteristics for recommendations. We provide a systematic review of GLRS, by discussing how they extract important knowledge from graph-based representations to improve the accuracy, reliability and explainability of the recommendations.
  arXiv  Detail & Related papers  (2021-05-13T14:50:45Z)
• Exploring the Limits of Few-Shot Link Prediction in Knowledge Graphs [49.6661602019124]
  We study a spectrum of models derived by generalizing the current state of the art for few-shot link prediction. We find that a simple zero-shot baseline - which ignores any relation-specific information - achieves surprisingly strong performance. Experiments on carefully crafted synthetic datasets show that having only a few examples of a relation fundamentally limits models from using fine-grained structural information.
  arXiv  Detail & Related papers  (2021-02-05T21:04:31Z)
• A Simple Approach to Case-Based Reasoning in Knowledge Bases [56.661396189466664]
  We present a surprisingly simple yet accurate approach to reasoning in knowledge graphs (KGs) that requires emphno training, and is reminiscent of case-based reasoning in classical artificial intelligence (AI) Consider the task of finding a target entity given a source entity and a binary relation. Our non-parametric approach derives crisp logical rules for each query by finding multiple textitgraph path patterns that connect similar source entities through the given relation.
  arXiv  Detail & Related papers  (2020-06-25T06:28:09Z)
• Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphs [96.73259297063619]
  We consider a novel formulation, zero-shot learning, to free this cumbersome curation. For newly-added relations, we attempt to learn their semantic features from their text descriptions. We leverage Generative Adrial Networks (GANs) to establish the connection between text and knowledge graph domain.
  arXiv  Detail & Related papers  (2020-01-08T01:19:08Z)

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.