CoRI: Collective Relation Integration with Data Augmentation for Open
Information Extraction
- URL: http://arxiv.org/abs/2106.00793v1
- Date: Tue, 1 Jun 2021 21:01:43 GMT
- Title: CoRI: Collective Relation Integration with Data Augmentation for Open
Information Extraction
- Authors: Zhengbao Jiang, Jialong Han, Bunyamin Sisman, Xin Luna Dong
- Abstract summary: We study relation integration that aims to align free-text relations in subject-relation-object extractions to relations in a target KG.
We propose a two-stage Collective Relation Integration model, where the first stage independently makes candidate predictions.
The second stage employs a collective model that accesses all candidate predictions to make globally coherent predictions.
- Score: 38.319595290576956
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Integrating extracted knowledge from the Web to knowledge graphs (KGs) can
facilitate tasks like question answering. We study relation integration that
aims to align free-text relations in subject-relation-object extractions to
relations in a target KG. To address the challenge that free-text relations are
ambiguous, previous methods exploit neighbor entities and relations for
additional context. However, the predictions are made independently, which can
be mutually inconsistent. We propose a two-stage Collective Relation
Integration (CoRI) model, where the first stage independently makes candidate
predictions, and the second stage employs a collective model that accesses all
candidate predictions to make globally coherent predictions. We further improve
the collective model with augmented data from the portion of the target KG that
is otherwise unused. Experiment results on two datasets show that CoRI can
significantly outperform the baselines, improving AUC from .677 to .748 and
from .716 to .780, respectively.
Related papers
- Beyond Entity Alignment: Towards Complete Knowledge Graph Alignment via Entity-Relation Synergy [14.459419325027612]
Knowledge Graph alignment aims to integrate knowledge from multiple sources to address the limitations of individual Knowledge Graphs.
Existing models primarily emphasize the linkage of cross-graph entities but overlook aligning relations across KGs.
We propose a novel Expectation-Maximization-based model, EREM, which iteratively optimize both sub-tasks.
arXiv Detail & Related papers (2024-07-25T03:40:09Z) - Towards Better Graph-based Cross-document Relation Extraction via Non-bridge Entity Enhancement and Prediction Debiasing [30.204313638661255]
Cross-document Relation Extraction aims to predict the relation between target entities located in different documents.
We propose a novel graph-based cross-document RE model with non-bridge entity enhancement and prediction debiasing.
arXiv Detail & Related papers (2024-06-24T11:08:28Z) - A Relation-Interactive Approach for Message Passing in Hyper-relational
Knowledge Graphs [0.0]
We propose a message-passing-based graph encoder with global relation structure awareness ability, which we call ReSaE.
Our experiments demonstrate that ReSaE achieves state-of-the-art performance on multiple link prediction benchmarks.
arXiv Detail & Related papers (2024-02-23T06:55:04Z) - Stacked Hybrid-Attention and Group Collaborative Learning for Unbiased
Scene Graph Generation [62.96628432641806]
Scene Graph Generation aims to first encode the visual contents within the given image and then parse them into a compact summary graph.
We first present a novel Stacked Hybrid-Attention network, which facilitates the intra-modal refinement as well as the inter-modal interaction.
We then devise an innovative Group Collaborative Learning strategy to optimize the decoder.
arXiv Detail & Related papers (2022-03-18T09:14:13Z) - Document-level Relation Extraction with Context Guided Mention
Integration and Inter-pair Reasoning [18.374097786748834]
Document-level Relation Extraction (DRE) aims to recognize the relations between two entities.
Few previous studies have investigated the mention integration, which may be problematic.
We propose two novel techniques, Context Guided Mention Integration and Inter-pair Reasoning.
arXiv Detail & Related papers (2022-01-13T08:00:23Z) - 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) - 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) - A Frustratingly Easy Approach for Entity and Relation Extraction [25.797992240847833]
We present a simple pipelined approach for entity and relation extraction.
We establish the new state-of-the-art on standard benchmarks (ACE04, ACE05 and SciERC)
Our approach essentially builds on two independent encoders and merely uses the entity model to construct the input for the relation model.
arXiv Detail & Related papers (2020-10-24T07:14:01Z) - HittER: Hierarchical Transformers for Knowledge Graph Embeddings [85.93509934018499]
We propose Hitt to learn representations of entities and relations in a complex knowledge graph.
Experimental results show that Hitt achieves new state-of-the-art results on multiple link prediction.
We additionally propose a simple approach to integrate Hitt into BERT and demonstrate its effectiveness on two Freebase factoid answering datasets.
arXiv Detail & Related papers (2020-08-28T18:58:15Z) - Combining Task Predictors via Enhancing Joint Predictability [53.46348489300652]
We present a new predictor combination algorithm that improves the target by i) measuring the relevance of references based on their capabilities in predicting the target, and ii) strengthening such estimated relevance.
Our algorithm jointly assesses the relevance of all references by adopting a Bayesian framework.
Based on experiments on seven real-world datasets from visual attribute ranking and multi-class classification scenarios, we demonstrate that our algorithm offers a significant performance gain and broadens the application range of existing predictor combination approaches.
arXiv Detail & Related papers (2020-07-15T21:58:39Z)
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.