Improving Performance of Relation Extraction Algorithm via Leveled Adversarial PCNN and Database Expansion
Diyah Puspitaningrum

TL;DR
This paper enhances relation extraction by combining leveled adversarial attention neural networks with database expansion using MDL, significantly improving accuracy and robustness over traditional methods.
Contribution
It introduces a novel approach combining database expansion via MDL with a leveled adversarial PCNN classifier for improved relation extraction performance.
Findings
Database expansion improves relation extraction accuracy.
Leveled adversarial attention enhances classifier robustness.
Performance achieved P@100=0.891 with expansion factor k=7.
Abstract
This study introduces database expansion using the Minimum Description Length (MDL) algorithm to expand the database for better relation extraction. Different from other previous relation extraction researches, our method improves system performance by expanding data. The goal of database expansion, together with a robust deep learning classifier, is to diminish wrong labels due to the incomplete or not found nature of relation instances in the relation database (e.g., Freebase). The study uses a deep learning method (Piecewise Convolutional Neural Network or PCNN) as the base classifier of our proposed approach: the leveled adversarial attention neural networks (LATTADV-ATT). In the database expansion process, the semantic entity identification is used to enlarge new instances using the most similar itemsets of the most common patterns of the data to get its pairs of entities. About…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsMinimum Description Length
