Graph-based semi-supervised learning techniques have recently attracted increasing attention as a means to utilize unlabeled data in machine learning by placing data points in a similarity graph. However, applying graph-based semi-supervised learning to natural language processing tasks presents unique challenges. First, natural language features are often discrete and do not readily reveal an underlying manifold structure, which complicates the already empirical graph construction process. Second, natural language processing problems often use structured inputs and outputs that do not naturally fit the graph-based framework Finally, scalability issues limit applicability to large data sets, which are common even in modestly-sized natural language processing applications. This research investigates novel approaches to using graph-based semi-supervised learning techniques for natural language processing, and addresses issues of distance measure learning, scalability, and structured inputs and outputs.
|School:||University of Washington|
|School Location:||United States -- Washington|
|Source:||DAI-B 70/09, Dissertation Abstracts International|
|Keywords:||Graph-based learning, Machine learning, Natural language processing|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be