Exploring Partial Knowledge Base Inference in Biomedical Entity Linking

• URL: http://arxiv.org/abs/2303.10330v3
• Date: Sat, 3 Jun 2023 07:57:51 GMT
• Title: Exploring Partial Knowledge Base Inference in Biomedical Entity Linking
• Authors: Hongyi Yuan, Keming Lu, Zheng Yuan
• Abstract summary: We name this scenario partial knowledge base inference. We construct benchmarks and witness a catastrophic degradation in EL performance due to dramatically precision drop. We propose two simple-and-effective redemption methods to combat the NIL issue with little computational overhead.
• Score: 0.4798394926736971
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Biomedical entity linking (EL) consists of named entity recognition (NER) and named entity disambiguation (NED). EL models are trained on corpora labeled by a predefined KB. However, it is a common scenario that only entities within a subset of the KB are precious to stakeholders. We name this scenario partial knowledge base inference: training an EL model with one KB and inferring on the part of it without further training. In this work, we give a detailed definition and evaluation procedures for this practically valuable but significantly understudied scenario and evaluate methods from three representative EL paradigms. We construct partial KB inference benchmarks and witness a catastrophic degradation in EL performance due to dramatically precision drop. Our findings reveal these EL paradigms can not correctly handle unlinkable mentions (NIL), so they are not robust to partial KB inference. We also propose two simple-and-effective redemption methods to combat the NIL issue with little computational overhead. Codes are released at https://github.com/Yuanhy1997/PartialKB-EL.

Related papers

• OneNet: A Fine-Tuning Free Framework for Few-Shot Entity Linking via Large Language Model Prompting [49.655711022673046]
  OneNet is an innovative framework that utilizes the few-shot learning capabilities of Large Language Models (LLMs) without the need for fine-tuning. OneNet is structured around three key components prompted by LLMs: (1) an entity reduction processor that simplifies inputs by summarizing and filtering out irrelevant entities, (2) a dual-perspective entity linker that combines contextual cues and prior knowledge for precise entity linking, and (3) an entity consensus judger that employs a unique consistency algorithm to alleviate the hallucination in the entity linking reasoning.
  arXiv  Detail & Related papers  (2024-10-10T02:45:23Z)
• Real World Conversational Entity Linking Requires More Than Zeroshots [50.5691094768954]
  We design targeted evaluation scenarios to measure the efficacy of EL models under resource constraints. We assess EL models' ability to generalize to a new unfamiliar KB using Fandom and a novel zero-shot conversational entity linking dataset. Results indicate that current zero-shot EL models falter when introduced to new, domain-specific KBs without prior training.
  arXiv  Detail & Related papers  (2024-09-02T10:37:53Z)
• BELHD: Improving Biomedical Entity Linking with Homonoym Disambiguation [4.477762005644463]
  Biomedical entity linking (BEL) is the task of grounding entity mentions to a knowledge base (KB) BELHD builds upon the BioSyn (Sung et al., 2020) model introducing two crucial extensions. Experiments with 10 corpora and five entity types show that BELHD improves upon state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-01-10T12:45:18Z)
• CAR: Conceptualization-Augmented Reasoner for Zero-Shot Commonsense Question Answering [56.592385613002584]
  We propose Conceptualization-Augmented Reasoner (CAR) to tackle the task of zero-shot commonsense question answering. CAR abstracts a commonsense knowledge triple to many higher-level instances, which increases the coverage of CommonSense Knowledge Bases. CAR more robustly generalizes to answering questions about zero-shot commonsense scenarios than existing methods.
  arXiv  Detail & Related papers  (2023-05-24T08:21:31Z)
• Reveal the Unknown: Out-of-Knowledge-Base Mention Discovery with Entity Linking [23.01938139604297]
  We propose a new BERT-based Entity Linking (EL) method which can identify mentions that do not have corresponding KB entities by matching them to a NIL entity. Results on five datasets show the advantages of BLINKout over existing methods to identify out-of-KB mentions.
  arXiv  Detail & Related papers  (2023-02-14T17:00:06Z)
• TIARA: Multi-grained Retrieval for Robust Question Answering over Large Knowledge Bases [20.751369684593985]
  TIARA outperforms previous SOTA, including those using PLMs or oracle entity annotations, by at least 4.1 and 1.1 F1 points on GrailQA and WebQuestionsSP.
  arXiv  Detail & Related papers  (2022-10-24T02:41:10Z)
• Knowing False Negatives: An Adversarial Training Method for Distantly Supervised Relation Extraction [8.764365529317923]
  We propose a two-stage approach to false negative relation extraction. First, it finds out possible FN samples by leveraging the memory mechanism of deep neural networks. Then, it aligns those unlabeled data with the training data into a unified feature space by adversarial training to assign pseudo labels.
  arXiv  Detail & Related papers  (2021-09-05T15:11:24Z)
• Ranking vs. Classifying: Measuring Knowledge Base Completion Quality [10.06803520598035]
  We argue that consideration of binary predictions is essential to reflect the actual KBC quality. We simulate the realistic scenario of real-world entities missing from a KB. We evaluate a number of state-of-the-art KB embeddings models on our new benchmark.
  arXiv  Detail & Related papers  (2021-02-02T17:53:48Z)
• Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion [59.549664231655726]
  A case-based reasoning (CBR) system solves a new problem by retrieving cases' that are similar to the given problem. In this paper, we demonstrate that such a system is achievable for reasoning in knowledge-bases (KBs) Our approach predicts attributes for an entity by gathering reasoning paths from similar entities in the KB.
  arXiv  Detail & Related papers  (2020-10-07T17:48:12Z)
• Learning Knowledge Bases with Parameters for Task-Oriented Dialogue Systems [79.02430277138801]
  The knowledge base (KB) plays an essential role in fulfilling user requests. End-to-end systems use the KB directly as input, but they cannot scale when the KB is larger than a few hundred entries. We propose a method to embed the KB, of any size, directly into the model parameters.
  arXiv  Detail & Related papers  (2020-09-28T22:13:54Z)
• BoxE: A Box Embedding Model for Knowledge Base Completion [53.57588201197374]
  Knowledge base completion (KBC) aims to automatically infer missing facts by exploiting information already present in a knowledge base (KB) Existing embedding models are subject to at least one of the following limitations. BoxE embeds entities as points, and relations as a set of hyper-rectangles (or boxes)
  arXiv  Detail & Related papers  (2020-07-13T09:40:49Z)

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.