A convex relaxation for weakly supervised relation extraction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

A convex relaxation for weakly supervised relation extraction


A promising approach to relation extraction, called weak or distant supervision, exploits an existing database of facts as training data, by aligning it to an unlabeled collection of text documents. Using this approach, the task of relation extraction can easily be scaled to hundreds of different relationships. However, distant supervision leads to a challenging multiple instance, multiple label learning problem. Most of the proposed solutions to this problem are based on non-convex formulations, and are thus prone to local minima. In this article, we propose a new approach to the problem of weakly supervised relation extraction, based on discriminative clustering and leading to a convex formulation. We demonstrate that our approach outperforms state-of-the-art methods on the challenging dataset introduced by Riedel et al. (2012).
No file

Dates and versions

hal-01080310 , version 1 (05-11-2014)


  • HAL Id : hal-01080310 , version 1


Edouard Grave. A convex relaxation for weakly supervised relation extraction. Conference on Empirical Methods in Natural Language Processing (EMNLP), ACL SIGDAT, Oct 2014, Doha, Qatar. ⟨hal-01080310⟩
113 View
0 Download


Gmail Facebook X LinkedIn More