Can We Predict New Facts with Open Knowledge Graph Embeddings? A Benchmark for Open Link Prediction (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for predicting knowledge graphs rely on the rich structure of the knowledge graph. |
| Approach: | They propose an evaluation protocol and a methodology for creating the open link prediction benchmark OlpBench. |
| Outcome: | The proposed model predicts test facts by completing questions in open link prediction task. |
Similar Papers
CaRe: Open Knowledge Graph Embeddings (D19-1)
Copied to clipboard
| Challenge: | Existing methods for generating Open Knowledge Graphs have been criticized for not achieving canonicalization of OpenKGs. |
| Approach: | They propose to use Open Information Extraction methods to extract triples from text . they propose to learn embeddings of NPs and RPs present in the graph . |
| Outcome: | The proposed methods improve OpenKG embeddings and bootstrap OpenKGs from text corpus. |
OKGIT: Open Knowledge Graph Link Prediction with Implicit Types (2021.findings-acl)
Copied to clipboard
| Challenge: | Open Knowledge Graphs (OpenKGs) are sparse and not directly usable in an end task. |
| Approach: | They propose a method that bootstraps OpenKGs from a corpus using OpenIE tools. |
| Outcome: | The proposed method achieves state-of-the-art performance while producing type compatible NPs in the link prediction task. |
Duality of Link Prediction and Entailment Graph Induction (P19-1)
Copied to clipboard
| Challenge: | In this paper, we show that link prediction and entailment graph induction are complementary. |
| Approach: | They propose an entailment score that exploits the new facts discovered by the link prediction model and then form engorgement graphs between relations. |
| Outcome: | The proposed entailment score outperforms prior state-of-the-art results on a standard entialment dataset and the new link prediction scores show improvements over the raw link prediction score. |
Linking Surface Facts to Large-Scale Knowledge Graphs (2023.emnlp-main)
Copied to clipboard
| Challenge: | Open Information Extraction (OIE) methods extract facts in the form of triples . ambiguity of these triples hinders their downstream usage . |
| Approach: | They propose a benchmark that measures fact linking performance on a granular triple slot level . they propose to use a system that can detect out-of-KG entities and predicates . |
| Outcome: | The proposed benchmark can measure fact linking performance on a granular triple slot level while also measuring if a system can recognize that a surface form has no match in the existing KG. |
Integrating Lexical Information into Entity Neighbourhood Representations for Relation Prediction (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods to predict knowledge base relations are limited by maintenance costs and text-based formats. |
| Approach: | They propose a system that can extend relational database tables with information extracted from a document corpus. |
| Outcome: | The proposed system outperforms existing methods by incorporating embeddings of text-based representations of the entities and relations. |
Open-Domain Contextual Link Prediction and its Complementarity with Entailment Graphs (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for linking knowledge graphs only use textual contexts . contextual link prediction is useful for finding context-dependent entailments . |
| Approach: | They propose a task of open-domain contextual link prediction which uses textual context and KG structure to perform link prediction. |
| Outcome: | The proposed model can ground the triples in the context of the original dataset and infer missing relations in context. |
Link Prediction on N-ary Relational Facts: A Graph-based Approach (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing work on knowledge graphs (KGs) focused on binary relations, but higher-arity relations are ubiquitous in real-world KGs. |
| Approach: | They propose a graph-based approach to link prediction on knowledge graphs using n-ary relational facts and edge-biased fully-connected attention. |
| Outcome: | The proposed approach performs substantially better than current state-of-the-art across a variety of n-ary relational benchmarks. |
A Survey of Link Prediction in N-ary Knowledge Graphs (2025.emnlp-main)
Copied to clipboard
Jiyao Wei, Saiping Guan, Da Li, Zhongni Hou, Miao Su, Yucan Guo, Xiaolong Jin, Jiafeng Guo, Xueqi Cheng
| Challenge: | N-ary Knowledge Graphs (NKGs) capture n-ary facts containing more than two entities. |
| Approach: | They present the first comprehensive survey of link prediction in NKGs . they provide an overview of the field and analyze their performance and application scenarios . |
| Outcome: | The proposed methods provide an overview of the field and analyze performance and application scenarios. |
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. |
Inspecting the concept knowledge graph encoded by modern language models (2021.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained language models are used to solve tasks such as summarization and information retrieval. |
| Approach: | They propose to use word embeddings, text generators, context encoders to extract underlying knowledge graphs of nine influential language models. |
| Outcome: | The proposed model is able to encode word embeddings, text generators, and context encoders, but suffers from several inaccuracies. |