Papers › Ranking-Based Automatic Seed Selection and Noise Reduction for Weakly Supervised...

Ranking-Based Automatic Seed Selection and Noise Reduction for Weakly Supervised Relation Extraction

1 Jul 2018ACL 2018 7archive 2025-07-28

Van-Thuy Phi, Joan Santoso, Masashi Shimbo, Yuji Matsumoto

This paper addresses the tasks of automatic seed selection for bootstrapping relation extraction, and noise reduction for distantly supervised relation extraction. We first point out that these tasks are related. Then, inspired by ranking relation instances and patterns computed by the HITS algorithm, and selecting cluster centroids using the K-means, LSA, or NMF method, we propose methods for selecting the initial seeds from an existing resource, or reducing the level of noise in the distantly labeled data. Experiments show that our proposed methods achieve a better performance than the baseline systems in both tasks.

PaperPDFCode

Code

pvthuy/part-whole-relations officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Relation ExtractionWord Sense Disambiguation

1 archive task tag without a task page not shown.

Datasets

Introduced by this paper, per the archive.

Part Whole Relations

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections