paper-with-me

Papers

OKGIT: Open Knowledge Graph Link Prediction with Implicit Types

2021-06-24 · Chandrahas, Partha Pratim Talukdar

Open Knowledge Graphs (OpenKG) refer to a set of (head noun phrase, relation phrase, tail noun phrase) triples such as (tesla, return to, new york) extracted from a corpus using OpenIE tools. While OpenKGs are easy to bootstrap for a domain, they are very sparse and far from being directly usable in an end task. Therefore, the task of predicting new facts, i.e., link prediction, becomes an important step while using these graphs in downstream tasks such as text comprehension, question answering, and web search query recommendation. Learning embeddings for OpenKGs is one approach for link prediction that has received some attention lately. However, on careful examination, we found that current OpenKG link prediction algorithms often predict noun phrases (NPs) with incompatible types for given noun and relation phrases. We address this problem in this work and propose OKGIT that improves OpenKG link prediction using novel type compatibility score and type regularization. With extensive experiments on multiple datasets, we show that the proposed method achieves state-of-the-art performance while producing type compatible NPs in the link prediction task.

📄 PDF Abstract BibTeX arXiv:2106.12806

Code (1)

Chandrahasd/OKGIT 공식 구현 pytorch

Tasks

Knowledge GraphsLink PredictionPredictionQuestion AnsweringReading ComprehensionRelation

Similar Papers 제목 키워드 기반

OKGIT: Open Knowledge Graph Link Prediction with Implicit Types

2021-08-01 · Findings (ACL) 2021 8 · . Chandrahas, Partha Talukdar
Link PredictionPrediction

Can We Predict New Facts with Open Knowledge Graph Embeddings? A Benchmark for Open Link Prediction

2020-07-01 · ACL 2020 6 · Samuel Broscheit, Kiril Gashteovski, Yanjie Wang, Rainer Gemulla

Open Information Extraction systems extract ({``}subject text{''}, {``}relation text{''}, {``}object text{''}) triples from raw text. Some triples are textual versions of facts, i.e., non-canonicalized mentions of entiti…

Graph EmbeddingKnowledge Graph EmbeddingKnowledge Graph EmbeddingsLink Prediction+4

An Open-World Extension to Knowledge Graph Completion Models

2019-06-19 · Haseeb Shah, Johannes Villmow, Adrian Ulges, Ulrich Schwanecke 외

We present a novel extension to embedding-based knowledge graph completion models which enables them to perform open-world link prediction, i.e. to predict facts for entities unseen in training based on their textual des…

Knowledge Graph CompletionLink PredictionPredictionWord Embeddings

Linking OpenStreetMap with Knowledge Graphs -- Link Discovery for Schema-Agnostic Volunteered Geographic Information

2020-11-06 · Nicolas Tempelmeier, Elena Demidova

Representations of geographic entities captured in popular knowledge graphs such as Wikidata and DBpedia are often incomplete. OpenStreetMap (OSM) is a rich source of openly available, volunteered geographic information …

Knowledge GraphsLink Prediction

Open-Domain Contextual Link Prediction and its Complementarity with Entailment Graphs

2021-11-01 · Findings (EMNLP) 2021 11 · Mohammad Javad Hosseini, Shay B. Cohen, Mark Johnson, Mark Steedman

An open-domain knowledge graph (KG) has entities as nodes and natural language relations as edges, and is constructed by extracting (subject, relation, object) triples from text. The task of open-domain link prediction i…

Link PredictionPrediction