How Knowledge Graph and Attention Help? A Qualitative Analysis into Bag-level Relation Extraction (2021.acl-long)
Copied to clipboard
| Challenge: | Knowledge Graph (KG) and attention mechanism have been demonstrated effective in introducing and selecting useful information for weakly supervised methods. |
| Approach: | They propose a paradigm to quantitatively evaluate the effect of attention and KG on bag-level relation extraction (RE) they propose to incorporate entity prior to KG-enhanced attention to improve RE performance . |
| Outcome: | The proposed model achieves significant improvements on two real-world datasets compared with three state-of-the-art baselines. |
Similar Papers
Two Training Strategies for Improving Relation Extraction over Universal Graph (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing methods for Distantly Supervised Relation Extraction (DS-RE) with a UG may lead to degradation in performance. |
| Approach: | They propose to use a Universal Graph (UG) to train a distantly supervised relation extraction model. |
| Outcome: | The proposed training strategies on biomedical and NYT10 datasets prove the robustness of the proposed methods and achieve state-of-the-art results. |
Incorporating Graph Attention Mechanism into Knowledge Graph Reasoning Based on Deep Reinforcement Learning (D19-1)
Copied to clipboard
| Challenge: | Existing methods for learning knowledge Graphs are incomplete and therefore need well-pretraining. |
| Approach: | They propose a deep reinforcement learning based model which incorporates LSTM and Graph Attention Mechanism as the memory components. |
| Outcome: | The proposed model can get rid of the pretraining process and achieve state-of-the-art performance compared with the other models. |
Improving Relation Extraction with Knowledge-attention (D19-1)
Copied to clipboard
| Challenge: | Existing attention mechanisms are data-driven, but most are data driven. |
| Approach: | They propose a knowledge-attention encoder which integrates prior knowledge from external lexical resources into deep neural networks for relation extraction task. |
| Outcome: | The proposed system outperforms existing CNN, RNN, and self-attention based models on a large-scale relation extraction dataset. |
Hierarchical Relation Extraction with Coarse-to-Fine Grained Attention (D18-1)
Copied to clipboard
| Challenge: | Existing methods for relation extraction use knowledge graphs to automatically label training data . but, it suffers from the wrong labeling problem because not all sentences containing two entities can express their relations in KGs . |
| Approach: | They propose a distant supervision approach to automatically label training instances . they integrate hierarchical information of relations into distantly supervised relation extraction . |
| Outcome: | The proposed model outperforms baseline models on a large-scale dataset. |
Relation Extraction with Word Graphs from N-grams (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies for relation extraction (RE) leverage the dependency tree of the input sentence to improve performance. |
| Approach: | They propose to use a graph convolutional network to build a context graph without dependency parsers. |
| Outcome: | The proposed approach improves neural RE methods without dependency parsers on English benchmark datasets. |
Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs (P19-1)
Copied to clipboard
| Challenge: | Existing knowledge graphs (KGs) are incomplete or partial information, in the form of missing relations between entities, which gives rise to the task of knowledge base completion (also known as relation prediction). |
| Approach: | They propose to capture both entity and relation features in any given neighborhood and encapsulate relation clusters and multi-hop relations in their attention-based model. |
| Outcome: | The proposed model captures both entity and relation features in any given neighborhood and also encapsulates relation clusters and multi-hop relations. |
KGPool: Dynamic Knowledge Graph Context Selection for Relation Extraction (2021.findings-acl)
Copied to clipboard
Abhishek Nadgeri, Anson Bastos, Kuldeep Singh, Isaiah Onando Mulang’, Johannes Hoffart, Saeedeh Shekarpour, Vijay Saraswat
| Challenge: | Existing methods for relation extraction (RE) use only expanded facts from the knowledge graph . |
| Approach: | They propose a method for relation extraction from a single sentence . they use a neural network to expand the context with additional facts from the KG . |
| Outcome: | The proposed method is more accurate than state-of-the-art methods on standard datasets. |
Relation Extraction with Explanation (2020.acl-main)
Copied to clipboard
| Challenge: | Recent studies focus on improving relation extraction accuracy but little is known about their explanability. |
| Approach: | They propose to automatically generate "distractor" sentences to augment the bags and train the model to ignore the distractors. |
| Outcome: | The proposed model improves extraction accuracy while also explanability. |
A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Existing approaches to extract relationship between entities in sentences suffer from missing or redundant information. |
| Approach: | They propose a deep neural model that combines the advantages of the two approaches to extract the relationship between two entities in a sentence. |
| Outcome: | The proposed model outperforms baseline models on the SemEval-2010 dataset. |
Graph Enhanced Dual Attention Network for Document-Level Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Document-level relation extraction requires inter-sentence reasoning capabilities to capture local and global contextual information for multiple relation facts. |
| Approach: | They propose to characterize the interaction between sentences and potential relation instances via a Graph Enhanced Dual Attention network (GEDA) . they also propose a simple yet effective regularizer based on the natural duality of the S2R and R2S attentions, whose weights are also supervised by the supporting evidence of relation instances during training. |
| Outcome: | The proposed model achieves competitive performance on an existing large-scale dataset while the predictions can be interpretable and easily observed. |