Discrete-State Variational Autoencoders for Joint Discovery and Factorization of Relations
Authors:
Open Access
- 1 December 2016
- journal article
- Published by MIT Press in Transactions of the Association for Computational Linguistics
- Vol. 4, 231-244
Abstract
We present a method for unsupervised open-domain relation discovery. In contrast to previous (mostly generative and agglomerative clustering) approaches, our model relies on rich contextual features and makes minimal independence assumptions. The model is composed of two parts: a feature-rich relation extractor, which predicts a semantic relation between two entities, and a factorization model, which reconstructs arguments (i.e., the entities) relying on the predicted relation. The two components are estimated jointly so as to minimize errors in recovering arguments. We study factorization models inspired by previous work in relation factorization and selectional preference modeling. Our models substantially outperform the generative and agglomerative-clustering counterparts and achieve state-of-the-art performance.Keywords
This publication has 7 references indexed in Scilit:
- Exploiting entity relationship for query expansion in enterprise searchInformation Retrieval Journal, 2014
- A semantic matching energy function for learning with multi-relational dataMachine Learning, 2013
- A non-negative tensor factorization model for selectional preference inductionNatural Language Engineering, 2010
- Tensor Decompositions and ApplicationsSIAM Review, 2009
- Connectionist learning proceduresArtificial Intelligence, 1989
- FRAME SEMANTICS AND THE NATURE OF LANGUAGE*Annals of the New York Academy of Sciences, 1976
- Some Mathematical Notes on Three-Mode Factor AnalysisPsychometrika, 1966