On the Effectiveness of Knowledge Graph Embeddings: a Rule Mining Approach

• URL: http://arxiv.org/abs/2206.00983v1
• Date: Thu, 2 Jun 2022 10:57:09 GMT
• Title: On the Effectiveness of Knowledge Graph Embeddings: a Rule Mining Approach
• Authors: Johanna J{\o}sang, Ricardo Guimar\~aes, Ana Ozaki
• Abstract summary: We study the effectiveness of Knowledge Graph Embeddings (KGE) for knowledge graph (KG) completion with rule mining. More specifically, we mine rules from KGs before and after they have been completed by a KGE to compare possible differences in the rules extracted. Our experiments indicate that there can be huge differences between the extracted rules, depending on the KGE approach for KG completion.
• Score: 11.556969989963358
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the effectiveness of Knowledge Graph Embeddings (KGE) for knowledge graph (KG) completion with rule mining. More specifically, we mine rules from KGs before and after they have been completed by a KGE to compare possible differences in the rules extracted. We apply this method to classical KGEs approaches, in particular, TransE, DistMult and ComplEx. Our experiments indicate that there can be huge differences between the extracted rules, depending on the KGE approach for KG completion. In particular, after the TransE completion, several spurious rules were extracted.

Related papers

• Learning Rules from KGs Guided by Language Models [48.858741745144044]
  Rule learning methods can be applied to predict potentially missing facts. Ranking of rules is especially challenging over highly incomplete or biased KGs. With the recent rise of Language Models (LMs) several works have claimed that LMs can be used as alternative means for KG completion.
  arXiv  Detail & Related papers  (2024-09-12T09:27:36Z)
• On the Sweet Spot of Contrastive Views for Knowledge-enhanced Recommendation [49.18304766331156]
  We propose a new contrastive learning framework for KG-enhanced recommendation. We construct two separate contrastive views for KG and IG, and maximize their mutual information. Extensive experimental results on three real-world datasets demonstrate the effectiveness and efficiency of our method.
  arXiv  Detail & Related papers  (2023-09-23T14:05:55Z)
• ChatRule: Mining Logical Rules with Large Language Models for Knowledge Graph Reasoning [107.61997887260056]
  We propose a novel framework, ChatRule, unleashing the power of large language models for mining logical rules over knowledge graphs. Specifically, the framework is initiated with an LLM-based rule generator, leveraging both the semantic and structural information of KGs. To refine the generated rules, a rule ranking module estimates the rule quality by incorporating facts from existing KGs.
  arXiv  Detail & Related papers  (2023-09-04T11:38:02Z)
• Simple Rule Injection for ComplEx Embeddings [7.19573352891936]
  In this work, we propose InjEx, a mechanism to inject multiple types of rules through simple constraints. We demonstrate that InjEx infuses interpretable prior knowledge into the embedding space. Our experimental results reveal that InjEx outperforms both baseline KGC models as well as specialized few-shot models.
  arXiv  Detail & Related papers  (2023-08-07T03:19:59Z)
• 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)
• Generalizing to Unseen Elements: A Survey on Knowledge Extrapolation for Knowledge Graphs [46.202752149611776]
  Knowledge graphs (KGs) have become valuable knowledge resources in various applications. Conventional knowledge graph embedding (KGE) methods still face challenges when it comes to handling unseen entities or relations during model testing. We use a set of general terminologies to unify these methods and refer to them collectively as Knowledge Extrapolation.
  arXiv  Detail & Related papers  (2023-02-03T17:05:59Z)
• RulE: Knowledge Graph Reasoning with Rule Embedding [69.31451649090661]
  We propose a principled framework called textbfRulE (stands for Rule Embedding) to leverage logical rules to enhance KG reasoning. RulE learns rule embeddings from existing triplets and first-order rules by jointly representing textbfentities, textbfrelations and textbflogical rules in a unified embedding space. Results on multiple benchmarks reveal that our model outperforms the majority of existing embedding-based and rule-based approaches.
  arXiv  Detail & Related papers  (2022-10-24T06:47:13Z)
• EngineKGI: Closed-Loop Knowledge Graph Inference [37.15381932994768]
  EngineKGI is a novel closed-loop KG inference framework. It combines KGE and rule learning to complement each other in a closed-loop pattern. Our model outperforms other baselines on link prediction tasks.
  arXiv  Detail & Related papers  (2021-12-02T08:02:59Z)
• DSKReG: Differentiable Sampling on Knowledge Graph for Recommendation with Relational GNN [59.160401038969795]
  We propose differentiable sampling on Knowledge Graph for Recommendation with GNN (DSKReG) We devise a differentiable sampling strategy, which enables the selection of relevant items to be jointly optimized with the model training procedure. The experimental results demonstrate that our model outperforms state-of-the-art KG-based recommender systems.
  arXiv  Detail & Related papers  (2021-08-26T16:19:59Z)
• 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)

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.