Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExtracting Fine-Grained Knowledge Graphs of Scientific Claims: Dataset and Transformer-Based Results
استخراج الرسوم البيانية المعرفة الحبيبات الدقيقة للمطالبات العلمية: النتائج المستندة إلى DataSet
320
0 0
0.0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
تظهر النهج الحديثة القائمة على المحولات نتائج واعدة على استخراج المعلومات العلمية العلائقية. تركز مجموعات البيانات الحالية على وصف رفيع المستوى لكيفية تنفيذ البحث. بدلا من ذلك، نركز على التفاصيل الدقيقة لكيفية تقديم الرابطات التجريبية من خلال بناء SCICLAIL، وهي مجموعة بيانات من المطالبات العلمية المستمدة من أوراق العلوم الاجتماعية والسلوكية (SBS)، PubMed، وحالات الحبل 19. يشتمل مخطط شرح الرسم البياني الربيعي على أن الكيانات الخشنة فقط يمتد كعقد العقد والعلاقات كحواف بينهما، ولكن أيضا سمات الحبيبات الدقيقة التي تعدل الكيانات وعلاقاتها، لما مجموعه 12738 ملميا في الشئ. من خلال إدراج المزيد من أنواع الملصقات وأكثر من ضعف كثافة التسمية من مجموعات البيانات السابقة، يلتقط SCICIMAL مع الجمعيات السببية والمقارنة والتنبؤ والإحصائية والتناسبية على المتغيرات التجريبية إلى جانب مؤهلاتهم وسلعيتهم وأدليلهم. نحن نقوم بتوسيع العمل في كيان مشترك ومقرها المحول واستخراج العلاقات لاستنتاج مخططنا بشكل فعال، مما يدل على وعد الرسوم البيانية المعرفة بحبائها الجميلة في المطالبات العلمية وما بعدها.
Recent transformer-based approaches demonstrate promising results on relational scientific information extraction. Existing datasets focus on high-level description of how research is carried out. Instead we focus on the subtleties of how experimental associations are presented by building SciClaim, a dataset of scientific claims drawn from Social and Behavior Science (SBS), PubMed, and CORD-19 papers. Our novel graph annotation schema incorporates not only coarse-grained entity spans as nodes and relations as edges between them, but also fine-grained attributes that modify entities and their relations, for a total of 12,738 labels in the corpus. By including more label types and more than twice the label density of previous datasets, SciClaim captures causal, comparative, predictive, statistical, and proportional associations over experimental variables along with their qualifications, subtypes, and evidence. We extend work in transformer-based joint entity and relation extraction to effectively infer our schema, showing the promise of fine-grained knowledge graphs in scientific claims and beyond.
References used
https://aclanthology.org/
rate research
Read More
Knowledge graph entity typing aims to infer entities' missing types in knowledge graphs which is an important but under-explored issue. This paper proposes a novel method for this task by utilizing entities' contextual information. Specifically, we d
esign two inference mechanisms: i) N2T: independently use each neighbor of an entity to infer its type; ii) Agg2T: aggregate the neighbors of an entity to infer its type. Those mechanisms will produce multiple inference results, and an exponentially weighted pooling method is used to generate the final inference result. Furthermore, we propose a novel loss function to alleviate the false-negative problem during training. Experiments on two real-world KGs demonstrate the effectiveness of our method. The source code and data of this paper can be obtained from https://github.com/CCIIPLab/CET.
The design of expressive representations of entities and relations in a knowledge graph is an important endeavor. While many of the existing approaches have primarily focused on learning from relational patterns and structural information, the intrin
sic complexity of KG entities has been more or less overlooked. More concretely, we hypothesize KG entities may be more complex than we think, i.e., an entity may wear many hats and relational triplets may form due to more than a single reason. To this end, this paper proposes to learn disentangled representations of KG entities - a new method that disentangles the inner latent properties of KG entities. Our disentangled process operates at the graph level and a neighborhood mechanism is leveraged to disentangle the hidden properties of each entity. This disentangled representation learning approach is model agnostic and compatible with canonical KG embedding approaches. We conduct extensive experiments on several benchmark datasets, equipping a variety of models (DistMult, SimplE, and QuatE) with our proposed disentangling mechanism. Experimental results demonstrate that our proposed approach substantially improves performance on key metrics.
Recently, end-to-end (E2E) trained models for question answering over knowledge graphs (KGQA) have delivered promising results using only a weakly supervised dataset. However, these models are trained and evaluated in a setting where hand-annotated q
uestion entities are supplied to the model, leaving the important and non-trivial task of entity resolution (ER) outside the scope of E2E learning. In this work, we extend the boundaries of E2E learning for KGQA to include the training of an ER component. Our model only needs the question text and the answer entities to train, and delivers a stand-alone QA model that does not require an additional ER component to be supplied during runtime. Our approach is fully differentiable, thanks to its reliance on a recent method for building differentiable KGs (Cohen et al., 2020). We evaluate our E2E trained model on two public datasets and show that it comes close to baseline models that use hand-annotated entities.
With the recent surge in social applications relying on knowledge graphs, the need for techniques to ensure fairness in KG based methods is becoming increasingly evident. Previous works have demonstrated that KGs are prone to various social biases, a
nd have proposed multiple methods for debiasing them. However, in such studies, the focus has been on debiasing techniques, while the relations to be debiased are specified manually by the user. As manual specification is itself susceptible to human cognitive bias, there is a need for a system capable of quantifying and exposing biases, that can support more informed decisions on what to debias. To address this gap in the literature, we describe a framework for identifying biases present in knowledge graph embeddings, based on numerical bias metrics. We illustrate the framework with three different bias measures on the task of profession prediction, and it can be flexibly extended to further bias definitions and applications. The relations flagged as biased can then be handed to decision makers for judgement upon subsequent debiasing.
Interactive machine reading comprehension (iMRC) is machine comprehension tasks where knowledge sources are partially observable. An agent must interact with an environment sequentially to gather necessary knowledge in order to answer a question. We
hypothesize that graph representations are good inductive biases, which can serve as an agent's memory mechanism in iMRC tasks. We explore four different categories of graphs that can capture text information at various levels. We describe methods that dynamically build and update these graphs during information gathering, as well as neural models to encode graph representations in RL agents. Extensive experiments on iSQuAD suggest that graph representations can result in significant performance improvements for RL agents.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
