pith. sign in

arxiv: 1601.03651 · v2 · pith:G4NEFW45new · submitted 2016-01-14 · 💻 cs.CL · cs.LG

Improved Relation Classification by Deep Recurrent Neural Networks with Data Augmentation

classification 💻 cs.CL cs.LG
keywords networksneuralclassificationrelationrecurrentarchitecturesaugmentationdata
0
0 comments X
read the original abstract

Nowadays, neural networks play an important role in the task of relation classification. By designing different neural architectures, researchers have improved the performance to a large extent in comparison with traditional methods. However, existing neural networks for relation classification are usually of shallow architectures (e.g., one-layer convolutional neural networks or recurrent networks). They may fail to explore the potential representation space in different abstraction levels. In this paper, we propose deep recurrent neural networks (DRNNs) for relation classification to tackle this challenge. Further, we propose a data augmentation method by leveraging the directionality of relations. We evaluated our DRNNs on the SemEval-2010 Task~8, and achieve an F1-score of 86.1%, outperforming previous state-of-the-art recorded results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Assessing Post Deletion in Sina Weibo: Multi-modal Classification of Hot Topics

    cs.SI 2019-06 unverdicted novelty 5.0

    Multi-modal analysis of 994 Weibo posts and 18,966 images finds sentiment as the sole consistent predictor of censorship, with anti-government topics deleted more often and average deletion time of three hours.