Improving Unsupervised Relation Extraction by Augmenting Diverse Sentence Pairs

Qing Wang, Kang Zhou, Qiao Qiao, Yuepei Li, Qi Li
12/1/2023
cs.CL

No official code found. Best implementation: qingwang-isu/AugURE (7 stars, MIT, last commit 2025-01-01).

Abstract

Unsupervised relation extraction (URE) aims to extract relations between named entities from raw text without requiring manual annotations or pre-existing knowledge bases. In recent studies of URE, researchers put a notable emphasis on contrastive learning strategies for acquiring relation representations. However, these studies often overlook two important aspects: the inclusion of diverse positive pairs for contrastive learning and the exploration of appropriate loss functions. In this paper, we propose AugURE with both within-sentence pairs augmentation and augmentation through cross-sentence pairs extraction to increase the diversity of positive pairs and strengthen the discriminative power of contrastive learning. We also identify the limitation of noise-contrastive estimation (NCE) loss for relation representation learning and propose to apply margin loss for sentence pairs. Experiments on NYT-FB and TACRED datasets demonstrate that the proposed relation representation learning and a simple K-Means clustering achieves state-of-the-art performance.

View on arXivView PDF

Code Implementations(1)

qingwang-isu/AugURECommunity100%
MIT
72PythonOct 20, 20231 years agoMIT

Similar Papers

Cite this paper

@article{wang2023improving,
  title  = {Improving Unsupervised Relation Extraction by Augmenting Diverse Sentence Pairs},
  author = {Qing Wang and Kang Zhou and Qiao Qiao and Yuepei Li and Qi Li},
  year   = {2023},
  eprint = {2312.00552},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.00552v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2312.00552.svg)](https://codeofpaper.com/paper/2312.00552)

Discussion