作者: Diego Marcheggiani , Ivan Titov
DOI: 10.1162/TACL_A_00095
关键词: Hierarchical clustering 、 Preference (economics) 、 Independence (probability theory) 、 Relation (database) 、 Theoretical computer science 、 Generative grammar 、 Factorization 、 State (functional analysis) 、 Machine learning 、 Contrast (statistics) 、 Artificial intelligence 、 Computer science
摘要: 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 makes minimal independence assumptions. The is composed of two parts: feature-rich extractor, which predicts semantic between entities, factorization model, reconstructs arguments (i.e., the entities) relying predicted relation. components are estimated jointly so as minimize errors in recovering arguments. study models inspired by work selectional preference modeling. Our substantially outperform agglomerative-clustering counterparts achieve state-of-the-art performance.