| Challenge: | Recent years have witnessed the emergence and growth of many large-scale knowledge bases (KBs) however, there are some issues unsettled towards enriching the KBs. |
| Approach: | They propose a framework that decomposes the discovery problem into several facet components and an auto-encoder component to estimate some facets of the fact. |
| Outcome: | The proposed framework achieves promising results on a benchmark dataset. |
Similar Papers
Knowledge Base Completion Meets Transfer Learning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge bases are tedious and require a large amount of labor to build. |
| Approach: | They propose a method that allows for transfer of knowledge from one collection of facts to another without entity or relation matching. |
| Outcome: | The proposed method is the most impactful on small datasets, showing a 6% increase in rank and 65% decrease in rank over the previous best method. |
A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network (N18-2)
Copied to clipboard
| Challenge: | Existing knowledge base embedding models are incomplete, i.e., missing a lot of valid triples. |
| Approach: | They propose a convolutional neural network embedding model for knowledge base completion that captures global relationships and transitional characteristics. |
| Outcome: | The proposed model outperforms state-of-the-art models on two benchmark datasets. |
Relation Discovery with Out-of-Relation Knowledge Base as Supervision (N19-1)
Copied to clipboard
| Challenge: | Existing methods to extract relations from text corpus without annotated data are violated by up to 31%. |
| Approach: | They propose to use out-of-relation knowledge bases to supervise the discovery of unseen relations where relations to discover from the text corpus and those in knowledge bases are not overlapped. |
| Outcome: | The proposed method improves the state-of-the-art relation discovery performance by a large margin. |
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. |
Reasoning Over Paths via Knowledge Base Completion (D19-53)
Copied to clipboard
| Challenge: | Existing methods to predict missing links in knowledge graphs are lacking. |
| Approach: | They propose a method to automatically rank paths between a source and target entity pair using a knowledge base completion model. |
| Outcome: | The proposed method can rank and rank paths in biomedical knowledge graphs with a KBC model. |
Connecting Language and Knowledge with Heterogeneous Representations for Neural Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Knowledge Bases (KBs) require constant updating to reflect changes to the world they represent. |
| Approach: | They propose a framework that unifies learning of RE and KBE models . the framework is based on a relation extraction task that uses a KB relation to a phrase . |
| Outcome: | The proposed framework unifies learning of RE and KBE models, leading to significant improvements over the state-of-the-art RE framework. |
mOKB6: A Multilingual Open Knowledge Base Completion Benchmark (2023.acl-short)
Copied to clipboard
| Challenge: | Open knowledge bases (Open KBCs) are constructed from triples of the form, which can be denoted as (s, r, o) by using open information extraction (Open IE) systems. |
| Approach: | They construct a dataset with facts from Wikipedia in six languages . they use open information extraction systems to extract triples from text . |
| Outcome: | The proposed dataset contains facts from Wikipedia in six languages including English . it improves existing Open KB construction pipeline by doing multilingual coreference resolution and keeping only entity-linked triples . |
Neural Relation Extraction for Knowledge Base Enrichment (P19-1)
Copied to clipboard
| Challenge: | Existing studies focus on the extraction itself and rely on Named Entity Disambiguation (NED) to map triples into knowledge base (KB) enrichment. |
| Approach: | They propose an end-to-end relation extraction model for knowledge base enrichment based on a neural encoder-decoder model . they propose to extract entities and their relationships from sentences in the form of triples and map the elements of the extracted triples to an existing KB in an end to end manner. |
| Outcome: | The proposed model outperforms state-of-the-art baselines by 15.51% and 8.38% on two real-world datasets. |
Evaluating the Knowledge Base Completion Potential of GPT (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Language models (LMs) have been proposed for unsupervised knowledge base completion (KBC) however, their ability to do this at scale and with high accuracy remains an open question. |
| Approach: | They propose to use language models to complete a large public KB, Wikidata, with 90% precision. |
| Outcome: | The proposed models can extend Wikidata by 27M facts at 90% precision. |
Type-Sensitive Knowledge Base Inference Without Explicit Type Supervision (P18-2)
Copied to clipboard
| Challenge: | State-of-the-art knowledge base completion models make frequent errors when ranking entities that are not compatible with the type required by the relation. |
| Approach: | They propose to enhance each base factorization with two type-compatibility terms between entity-relation pairs and combine the signals in a novel manner. |
| Outcome: | The proposed model achieves 7% MRR gains over baseline models and predicts supervised types better than baseline models. |