Bias modeling for distantly supervised relation extraction (Q1667103)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bias modeling for distantly supervised relation extraction |
scientific article; zbMATH DE number 6927722
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bias modeling for distantly supervised relation extraction |
scientific article; zbMATH DE number 6927722 |
Statements
Bias modeling for distantly supervised relation extraction (English)
0 references
27 August 2018
0 references
Summary: Distant supervision (DS) automatically annotates free text with relation mentions from existing knowledge bases (KBs), providing a way to alleviate the problem of insufficient training data for relation extraction in natural language processing (NLP). However, the heuristic annotation process does not guarantee the correctness of the generated labels, promoting a hot research issue on how to efficiently make use of the noisy training data. In this paper, we model two types of biases to reduce noise: (1) \textit{bias-dist} to model the relative distance between points (instances) and classes (relation centers); (2) \textit{bias-reward} to model the possibility of each heuristically generated label being incorrect. Based on the biases, we propose three noise tolerant models: \textit{MIML-dist}, \textit{MIML-dist-classify}, and \textit{MIML-reward}, building on top of a state-of-the-art distantly supervised learning algorithm. Experimental evaluations compared with three landmark methods on the KBP dataset validate the effectiveness of the proposed methods.
0 references
0.7872927784919739
0 references
0.7459751963615417
0 references
0.7125363945960999
0 references
0.6406297087669373
0 references