Find the Funding: Entity Linking with Incomplete Funding Knowledge Bases
- URL: http://arxiv.org/abs/2209.00351v1
- Date: Thu, 1 Sep 2022 10:41:42 GMT
- Title: Find the Funding: Entity Linking with Incomplete Funding Knowledge Bases
- Authors: Gizem Aydin, Seyed Amin Tabatabaei, Giorgios Tsatsaronis, Faegheh
Hasibi
- Abstract summary: Two major challenges of identifying and linking funding entities are: (i) sparse graph structure of the Knowledge Base (KB), and (ii) missing entities in KB.
We propose an entity linking model that can perform NIL prediction and overcome data scarcity issues in a time and data-efficient manner.
- Score: 1.9451328614697954
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Automatic extraction of funding information from academic articles adds
significant value to industry and research communities, such as tracking
research outcomes by funding organizations, profiling researchers and
universities based on the received funding, and supporting open access
policies. Two major challenges of identifying and linking funding entities are:
(i) sparse graph structure of the Knowledge Base (KB), which makes the commonly
used graph-based entity linking approaches suboptimal for the funding domain,
(ii) missing entities in KB, which (unlike recent zero-shot approaches)
requires marking entity mentions without KB entries as NIL. We propose an
entity linking model that can perform NIL prediction and overcome data scarcity
issues in a time and data-efficient manner. Our model builds on a
transformer-based mention detection and bi-encoder model to perform entity
linking. We show that our model outperforms strong existing baselines.
Related papers
- Graph Dimension Attention Networks for Enterprise Credit Assessment [40.87056211723355]
We propose a novel architecture named Graph Dimension Attention Network (GDAN)
GDAN incorporates a dimension-level attention mechanism to capture fine-grained risk-related characteristics.
We explore the interpretability of the GNN-based method in financial scenarios and propose a data-centric explainer for GDAN, called GDAN-DistShift.
arXiv Detail & Related papers (2024-07-16T11:24:28Z) - DiscoveryBench: Towards Data-Driven Discovery with Large Language Models [50.36636396660163]
We present DiscoveryBench, the first comprehensive benchmark that formalizes the multi-step process of data-driven discovery.
Our benchmark contains 264 tasks collected across 6 diverse domains, such as sociology and engineering.
Our benchmark, thus, illustrates the challenges in autonomous data-driven discovery and serves as a valuable resource for the community to make progress.
arXiv Detail & Related papers (2024-07-01T18:58:22Z) - Query of CC: Unearthing Large Scale Domain-Specific Knowledge from
Public Corpora [104.16648246740543]
We propose an efficient data collection method based on large language models.
The method bootstraps seed information through a large language model and retrieves related data from public corpora.
It not only collects knowledge-related data for specific domains but unearths the data with potential reasoning procedures.
arXiv Detail & Related papers (2024-01-26T03:38:23Z) - FinGPT: Instruction Tuning Benchmark for Open-Source Large Language
Models in Financial Datasets [9.714447724811842]
This paper introduces a distinctive approach anchored in the Instruction Tuning paradigm for open-source large language models.
We capitalize on the interoperability of open-source models, ensuring a seamless and transparent integration.
The paper presents a benchmarking scheme designed for end-to-end training and testing, employing a cost-effective progression.
arXiv Detail & Related papers (2023-10-07T12:52:58Z) - Bridged-GNN: Knowledge Bridge Learning for Effective Knowledge Transfer [65.42096702428347]
Graph Neural Networks (GNNs) aggregate information from neighboring nodes.
Knowledge Bridge Learning (KBL) learns a knowledge-enhanced posterior distribution for target domains.
Bridged-GNN includes an Adaptive Knowledge Retrieval module to build Bridged-Graph and a Graph Knowledge Transfer module.
arXiv Detail & Related papers (2023-08-18T12:14:51Z) - REFinD: Relation Extraction Financial Dataset [7.207699035400335]
We propose REFinD, the first large-scale annotated dataset of relations, with $sim$29K instances and 22 relations amongst 8 types of entity pairs, generated entirely over financial documents.
We observed that various state-of-the-art deep learning models struggle with numeric inference, relational and directional ambiguity.
arXiv Detail & Related papers (2023-05-22T22:40:11Z) - A Pipeline for Analysing Grant Applications [0.0]
This paper investigates whether grant schemes successfully identifies innovative project proposals, as intended.
Grant applications are peer-reviewed research proposals that include specific innovation and creativity'' (IC) scores assigned by reviewers.
We propose a model with the best performance, a Random Forest (RF) classifier over documents encoded with features.
arXiv Detail & Related papers (2022-10-30T13:43:53Z) - SAIS: Supervising and Augmenting Intermediate Steps for Document-Level
Relation Extraction [51.27558374091491]
We propose to explicitly teach the model to capture relevant contexts and entity types by supervising and augmenting intermediate steps (SAIS) for relation extraction.
Based on a broad spectrum of carefully designed tasks, our proposed SAIS method not only extracts relations of better quality due to more effective supervision, but also retrieves the corresponding supporting evidence more accurately.
arXiv Detail & Related papers (2021-09-24T17:37:35Z) - Fund2Vec: Mutual Funds Similarity using Graph Learning [0.966840768820136]
We propose a radically new approach to identify similar funds based on the weighted bipartite network representation of funds and their underlying assets data.
Ours is the first ever study of the weighted bipartite network representation of the funds-assets network in its original form.
arXiv Detail & Related papers (2021-06-24T17:35:00Z) - 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) - Towards Inheritable Models for Open-Set Domain Adaptation [56.930641754944915]
We introduce a practical Domain Adaptation paradigm where a source-trained model is used to facilitate adaptation in the absence of the source dataset in future.
We present an objective way to quantify inheritability to enable the selection of the most suitable source model for a given target domain, even in the absence of the source data.
arXiv Detail & Related papers (2020-04-09T07:16:30Z)
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.