Aligning Knowledge and Text Embeddings by Entity Descriptions
Published 1 January 2015Open access
Huaping Zhong, Jianwen Zhang, Zhen Wang, Hai Wan, Zheng Chen
Citations167
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new alignment model based on text descriptions of entities, without dependency on anchors is proposed, which requires the embedding vector of an entity not only to fit the structured constraints in KBs but also to be equal to theembedding vector computed from the text description.
Abstract
We study the problem of jointly embedding a knowledge base and a text corpus. The key issue is the alignment model making sure the vectors of entities, relations and words are in the same space. Wang et al. (2014a) rely on Wikipedia anchors, making the applicable scope quite limited. In this paper we propose a new alignment model based on text descriptions of entities, without dependency on anchors. We require the embedding vector of an entity not only to fit the structured constraints in KBs but also to be equal to the embedding vector computed from the text description. Extensive experiments show that, the proposed approach consistently performs comparably or even better than the method of Wang et al. (2014a), which is encouraging as we do not use any anchor information.
Keywords
Computer Science
arXiv (Cornell University)Distributed Representations of Words and Phrases and their Compositionality
18,086 Citations2013Tomáš Mikolov, Ilya Sutskever +3 more
This paper presents a simple method for finding phrases in text, and shows that learning good vector representations for millions of phrases is possible and describes a simple alternative to the hierarchical softmax called negative sampling.
arXiv (Cornell University)Efficient Estimation of Word Representations in Vector Space
18,050 Citations2013Tomáš Mikolov, Kai Chen +2 more
Two novel model architectures for computing continuous vector representations of words from very large data sets are proposed and it is shown that these vectors provide state-of-the-art performance on the authors' test set for measuring syntactic and semantic word similarities.
arXiv (Cornell University)Efficient Estimation of Word Representations in Vector Space
11,710 Citations2013Tomáš Mikolov, Kai Chen +2 more
Translating embeddings for modeling multi-relational data
5,178 Citations2015Antoine Bordes, Nicolas Usunier +2 more
TransE is proposed, a method which models relationships by interpreting them as translations operating on the low-dimensional embeddings of the entities, which proves to be powerful since extensive experiments show that TransE significantly outperforms state-of-the-art methods in link prediction on two knowledge bases.
Proceedings of the AAAI Conference on Artificial IntelligenceKnowledge Graph Embedding by Translating on Hyperplanes
3,787 Citations2014Zhen Wang, Jianwen Zhang +2 more
This paper proposes TransH which models a relation as a hyperplane together with a translation operation on it and can well preserve the above mapping properties of relations with almost the same model complexity of TransE.
Proceedings of the AAAI Conference on Artificial IntelligenceLearning Entity and Relation Embeddings for Knowledge Graph Completion
3,648 Citations2015Yankai Lin, Zhiyuan Liu +3 more
TransR is proposed to build entity and relation embeddings in separate entity space and relation spaces by first projecting entities from entity space to corresponding relation space and then building translations between projected entities.
Distant supervision for relation extraction without labeled data
2,913 Citations2009Mike D. Mintz, Steven Bills +2 more
This work investigates an alternative paradigm that does not require labeled corpora, avoiding the domain dependence of ACE-style algorithms, and allowing the use of corpora of any size.
Reasoning With Neural Tensor Networks for Knowledge Base Completion
1,669 Citations2013Richard Socher, Danqi Chen +2 more
An expressive neural tensor network suitable for reasoning over relationships between two entities given a subset of the knowledge base is introduced and performance can be improved when entities are represented as an average of their constituting word vectors.
Lecture notes in computer scienceModeling Relations and Their Mentions without Labeled Text
1,331 Citations2010Sebastian Riedel, Limin Yao +1 more
A novel approach to distant supervision that can alleviate the problem of noisy patterns that hurt precision by using a factor graph and applying constraint-driven semi-supervision to train this model without any knowledge about which sentences express the relations in the authors' training KB.
Learning Structured Embeddings of Knowledge Bases
861 Citations2011Antoine Bordes, Jason Weston +2 more
Machine LearningA semantic matching energy function for learning with multi-relational data
687 Citations2013Antoine Bordes, Xavier Glorot +2 more
A new neural network architecture designed to embed multi-relational graphs into a flexible continuous vector space in which the original data is kept and enhanced, demonstrating that it can scale up to tens of thousands of nodes and thousands of types of relation.
Multi-instance Multi-label Learning for Relation Extraction
682 Citations2012Mihai Surdeanu, Julie Tibshirani +2 more
This work proposes a novel approach to multi-instance multi-label learning for RE, which jointly models all the instances of a pair of entities in text and all their labels using a graphical model with latent variables that performs competitively on two difficult domains.
Knowledge Graph and Text Jointly Embedding
412 Citations2014Zhen Wang, Jianwen Zhang +2 more
Large scale experiments on Freebase and a Wikipedia/NY Times corpus show that jointly embedding brings promising improvement in the accuracy of predicting facts, compared to separately embedding knowledge graphs and text.
Multi-Relational Latent Semantic Analysis
59 Citations2013Kai-Wei Chang, Wen-tau Yih +1 more
It is demonstrated that by integrating multiple relations from both homogeneous and heterogeneous information sources, MRLSA achieves state-of-the-art performance on existing benchmark datasets for two relations, antonymy and is-a.
arXiv (Cornell University)A Semantic Matching Energy Function for Learning with Multi-relational Data
32 Citations2013Xavier Glorot, Antoine Bordes +2 more