paper-with-me

Papers

Modeling Relation Paths for Representation Learning of Knowledge Bases

2015-06-01 · EMNLP 2015 9 · Yankai Lin, Zhiyuan Liu, Huanbo Luan, Maosong Sun, Siwei Rao, Song Liu

Representation learning of knowledge bases (KBs) aims to embed both entities and relations into a low-dimensional space. Most existing methods only consider direct relations in representation learning. We argue that multiple-step relation paths also contain rich inference patterns between entities, and propose a path-based representation learning model. This model considers relation paths as translations between entities for representation learning, and addresses two key challenges: (1) Since not all relation paths are reliable, we design a path-constraint resource allocation algorithm to measure the reliability of relation paths. (2) We represent relation paths via semantic composition of relation embeddings. Experimental results on real-world datasets show that, as compared with baselines, our model achieves significant and consistent improvements on knowledge base completion and relation extraction from text.

📄 PDF Abstract BibTeX arXiv:1506.00379

Code (1)

Mrlyk423/Relation_Extraction 공식 구현

Tasks

Knowledge Base CompletionRelationRelation ExtractionRepresentation LearningSemantic Composition

Similar Papers 제목 키워드 기반

A Topological View of Rule Learning in Knowledge Graphs

2021-09-29 · Zuoyu Yan, Tengfei Ma, Liangcai Gao, Zhi Tang 외

Inductive relation prediction is an important learning task for knowledge graph completion. One can use the existence of rules, namely a sequence of relations, to predict the relation between two entities. Previous works…

Inductive Relation PredictionKnowledge Graph CompletionKnowledge GraphsRelation+1

Compositional Learning of Relation Path Embedding for Knowledge Base Completion

2016-11-22 · Xixun Lin, Yanchun Liang, Fausto Giunchiglia, Xiaoyue Feng 외

Large-scale knowledge bases have currently reached impressive sizes; however, these knowledge bases are still far from complete. In addition, most of the existing methods for knowledge base completion only consider the d…

Knowledge Base CompletionRelation

Recurrent One-Hop Predictions for Reasoning over Knowledge Graphs

2018-06-12 · COLING 2018 8 · Wenpeng Yin, Yadollah Yaghoobzadeh, Hinrich Schütze

Large scale knowledge graphs (KGs) such as Freebase are generally incomplete. Reasoning over multi-hop (mh) KG paths is thus an important capability that is needed for question answering or other NLP tasks that require k…

Knowledge Base CompletionKnowledge GraphsQuestion AnsweringRelation

Chains of Reasoning over Entities, Relations, and Text using Recurrent Neural Networks

2016-07-05 · EACL 2017 4 · Rajarshi Das, Arvind Neelakantan, David Belanger, Andrew McCallum

Our goal is to combine the rich multistep inference of symbolic logical reasoning with the generalization capabilities of neural networks. We are particularly interested in complex reasoning about entities and relations …

Logical Reasoning

Go for a Walk and Arrive at the Answer: Reasoning Over Paths in Knowledge Bases using Reinforcement Learning

2017-11-15 · ICLR 2018 1 · Rajarshi Das, Shehzaad Dhuliawala, Manzil Zaheer, Luke Vilnis 외

Knowledge bases (KB), both automatically and manually constructed, are often incomplete --- many valid facts can be inferred from the KB by synthesizing existing information. A popular approach to KB completion is to inf…

NavigateReinforcement LearningRelationvalid