Constraint-based metric-aware approach for relation co-extraction
Chen, Xiaoyu
Loading…
Permalink
https://hdl.handle.net/2142/78684
Description
Title
Constraint-based metric-aware approach for relation co-extraction
Author(s)
Chen, Xiaoyu
Issue Date
2015-04-28
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
relation extraction
constraints
random walk
Abstract
This thesis focuses on relation extraction within unstructured text data. We are interested in the bootstrapping approach, in which only a small portion of examples are given to train the extractor. The training of the extractor is actually a process of finding good textual representation patterns for that relationship and the duality relationship between tuples and patterns are explored as a mutual enhancement in an iterative way. However, due to the lack of decent amount of labelled data at the beginning, the bootstrapping performance is often unsatisfactory. Recent literatures explore additional meta level information such as constraints and find a way to add it along with bootstrapping seeds to further reinforce supervision. Our approach takes a step further by exploring how to better incorporate such domain specific constraints into the ranking process of selecting textual patterns for better extraction precision and recall. Thus, we call it a constriant-based metric-aware approach. We explore three types of general constraints and develop models for each of them. We finally conduct experiment on the Wikipedia article dataset, and the results show that with our model, we can achieve significant performance boost in terms of f1 score.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
