Relevant Entity Selection: Knowledge Graph Bootstrapping via Zero-Shot
Analogical Pruning
- URL: http://arxiv.org/abs/2306.16296v2
- Date: Wed, 16 Aug 2023 09:28:17 GMT
- Title: Relevant Entity Selection: Knowledge Graph Bootstrapping via Zero-Shot
Analogical Pruning
- Authors: Lucas Jarnac, Miguel Couceiro, Pierre Monnin
- Abstract summary: We propose an analogy-based approach that starts from seed entities of interest in a generic KG, and keeps or prunes their neighboring entities.
We evaluate our approach on Wikidata through two manually labeled datasets that contain either domain-homogeneous or -heterogeneous seed entities.
- Score: 4.281723404774889
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Knowledge Graph Construction (KGC) can be seen as an iterative process
starting from a high quality nucleus that is refined by knowledge extraction
approaches in a virtuous loop. Such a nucleus can be obtained from knowledge
existing in an open KG like Wikidata. However, due to the size of such generic
KGs, integrating them as a whole may entail irrelevant content and scalability
issues. We propose an analogy-based approach that starts from seed entities of
interest in a generic KG, and keeps or prunes their neighboring entities. We
evaluate our approach on Wikidata through two manually labeled datasets that
contain either domain-homogeneous or -heterogeneous seed entities. We
empirically show that our analogy-based approach outperforms LSTM, Random
Forest, SVM, and MLP, with a drastically lower number of parameters. We also
evaluate its generalization potential in a transfer learning setting. These
results advocate for the further integration of analogy-based inference in
tasks related to the KG lifecycle.
Related papers
- Multi-hop Question Answering over Knowledge Graphs using Large Language Models [1.8130068086063336]
We evaluate the capability of (LLMs) to answer questions over Knowledge graphs that involve multiple hops.
We show that depending upon the size and nature of the KG we need different approaches to extract and feed the relevant information to an LLM.
arXiv Detail & Related papers (2024-04-30T03:31:03Z) - Generate-on-Graph: Treat LLM as both Agent and KG in Incomplete Knowledge Graph Question Answering [90.30473970040362]
We propose a training-free method called Generate-on-Graph (GoG) that can generate new factual triples while exploring on Knowledge Graphs (KGs)
Specifically, we propose a selecting-generating-answering framework, which not only treat the LLM as an agent to explore on KGs, but also treat it as a KG to generate new facts based on the explored subgraph.
arXiv Detail & Related papers (2024-04-23T04:47:22Z) - Natural Language Processing for Drug Discovery Knowledge Graphs:
promises and pitfalls [0.0]
Building and analysing knowledge graphs (KGs) to aid drug discovery is a topical area of research.
We discuss promises and pitfalls of using natural language processing (NLP) to mine unstructured text as a data source for KGs.
arXiv Detail & Related papers (2023-10-24T07:35:24Z) - PyGraft: Configurable Generation of Synthetic Schemas and Knowledge
Graphs at Your Fingertips [3.5923669681271257]
PyGraft is a Python-based tool that generates customized, domain-agnostic schemas and KGs.
We aim to empower the generation of a more diverse array of KGs for benchmarking novel approaches in areas such as graph-based machine learning (ML)
In ML, this should foster a more holistic evaluation of model performance and generalization capability, thereby going beyond the limited collection of available benchmarks.
arXiv Detail & Related papers (2023-09-07T13:00:09Z) - Interactive Segmentation as Gaussian Process Classification [58.44673380545409]
Click-based interactive segmentation (IS) aims to extract the target objects under user interaction.
Most of the current deep learning (DL)-based methods mainly follow the general pipelines of semantic segmentation.
We propose to formulate the IS task as a Gaussian process (GP)-based pixel-wise binary classification model on each image.
arXiv Detail & Related papers (2023-02-28T14:01:01Z) - Walk-and-Relate: A Random-Walk-based Algorithm for Representation
Learning on Sparse Knowledge Graphs [5.444459446244819]
We propose an efficient method to augment the number of triplets to address the problem of data sparsity.
We also provide approaches to accurately and efficiently filter out informative metapaths from the possible set of metapaths.
The proposed approaches are model-agnostic, and the augmented training dataset can be used with any KG embedding approach out of the box.
arXiv Detail & Related papers (2022-09-19T05:35:23Z) - BertNet: Harvesting Knowledge Graphs with Arbitrary Relations from
Pretrained Language Models [65.51390418485207]
We propose a new approach of harvesting massive KGs of arbitrary relations from pretrained LMs.
With minimal input of a relation definition, the approach efficiently searches in the vast entity pair space to extract diverse accurate knowledge.
We deploy the approach to harvest KGs of over 400 new relations from different LMs.
arXiv Detail & Related papers (2022-06-28T19:46:29Z) - OntoMerger: An Ontology Integration Library for Deduplicating and
Connecting Knowledge Graph Nodes [2.6553713413568913]
OntoMerger is a Python integration library whose functionality is to deduplicate KG nodes.
Our approach takes a set of KG nodes, mappings and disconnected and generates a set of merged nodes together with a connected hierarchy.
OntoMerger can be applied to a wide variety of KGs.
arXiv Detail & Related papers (2022-06-05T18:52:26Z) - Scientific Language Models for Biomedical Knowledge Base Completion: An
Empirical Study [62.376800537374024]
We study scientific LMs for KG completion, exploring whether we can tap into their latent knowledge to enhance biomedical link prediction.
We integrate the LM-based models with KG embedding models, using a router method that learns to assign each input example to either type of model and provides a substantial boost in performance.
arXiv Detail & Related papers (2021-06-17T17:55:33Z) - Learning Intents behind Interactions with Knowledge Graph for
Recommendation [93.08709357435991]
Knowledge graph (KG) plays an increasingly important role in recommender systems.
Existing GNN-based models fail to identify user-item relation at a fine-grained level of intents.
We propose a new model, Knowledge Graph-based Intent Network (KGIN)
arXiv Detail & Related papers (2021-02-14T03:21:36Z) - Connecting the Dots: A Knowledgeable Path Generator for Commonsense
Question Answering [50.72473345911147]
This paper augments a general commonsense QA framework with a knowledgeable path generator.
By extrapolating over existing paths in a KG with a state-of-the-art language model, our generator learns to connect a pair of entities in text with a dynamic, and potentially novel, multi-hop relational path.
arXiv Detail & Related papers (2020-05-02T03:53:21Z)
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.