Towards better entity linking

Li, Mingyang; Xing, Yuqing; Kong, Fang; Zhou, Guodong

doi:10.1007/s11704-020-0192-9

Cited by 6 publications

(1 citation statement)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Entity Linking (EL) (Mingyang et al, 2021, Zhibin et al, 2022 (Cai et al, 2023) addressed the difficulty of models in learning diverse and more challenging negative samples in zero-shot entity linking scenarios. They proposed a generative negative sampling method that enables models to learn negative samples better, thereby improving the performance of zero-shot entity linking.…”

Section: Entity Linkingmentioning

confidence: 99%

LLM-KGMQA: Large Language Model-Augmented Multi-Hop Question-Answering System based on Knowledge Graph in Medical Field

Wang,

Shi,

Aguilar

et al. 2024

Preprint

View full text Add to dashboard Cite

In response to the problems of poor performance of large language models in specific domains, limited research on knowledge graphs and question-answering systems incorporating large language models, this paper proposed a multi-hop question-answering system framework based on a knowledge graph in the medical field, which was fully augmented by large language models (LLM-KGMQA). The method primarily addressed the problems of entity linking and multi-hop knowledge path reasoning. To address the entity linking problem, an entity fast-linking algorithm was proposed, which categorized entities based on multiple attributes. Then, it used user mentions to obtain the target attribute set of attributes and further narrowed the entity search scope through attribute intersection operations. Finally, for entities that remained too numerous after the intersection, the method suggested using a pre-trained model for similarity calculation and ranking, and to determine the final entity through construction instructions. Regarding multi-hop knowledge path reasoning, the paper proposed a three-step reasoning framework that included an n-hop subgraph construction algorithm, a knowledge fusion algorithm, and a semantics-based knowledge pruning algorithm. In the entity fast-linking experiments, the maximum computational complexity was reduced by 99.9% through intersection operations. Additionally, a new evaluation metric, top@n, was introduced. When using the Roberta model for similarity calculations, the top@n score reached a maximum of 96.4, and the entity fast-linking accuracy was 96.6%. In multi-hop knowledge path reasoning, the paper first validated the need for knowledge fusion by constructing three different forms of instructions. Subsequently, experiments were conducted with several large language models, concluded that the GLM4 model showed the best performance in Chinese semantic reasoning. The accuracy rates for GLM4 after pruning were 99.9%, 83.3%, and 86.6% for 1-hop, 2-hop, and 3-hop, respectively, compared to 95.0%, 6.6%, and 5.0% before pruning. The average response time was reduced by 1.36s, 6.21s and 27.07s after pruning compared to before pruning.

show abstract

Section: Entity Linkingmentioning

confidence: 99%