A convex relaxation for weakly supervised relation extraction

Edouard Grave 1, 2, 3
2 SIERRA - Statistical Machine Learning and Parsimony
DI-ENS - Département d'informatique de l'École normale supérieure, ENS Paris - École normale supérieure - Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR8548
Abstract : 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).
Type de document :
Communication dans un congrès
Conference on Empirical Methods in Natural Language Processing (EMNLP), Oct 2014, Doha, Qatar. 2014, 〈http://emnlp2014.org/〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01080310
Contributeur : Edouard Grave <>
Soumis le : mercredi 5 novembre 2014 - 00:52:15
Dernière modification le : vendredi 25 mai 2018 - 12:02:06

Identifiants

  • HAL Id : hal-01080310, version 1

Collections

Citation

Edouard Grave. A convex relaxation for weakly supervised relation extraction. Conference on Empirical Methods in Natural Language Processing (EMNLP), Oct 2014, Doha, Qatar. 2014, 〈http://emnlp2014.org/〉. 〈hal-01080310〉

Partager

Métriques

Consultations de la notice

166