<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T10:18:27Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3076" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3076</identifier><datestamp>2017-03-21T20:01:36Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="919de46d-19de-4ce7-86f6-c9c9c54acea5" confidence="600">Xu, Linli</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-05-22T18:30:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-05-22T18:30:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-05-22T18:30:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3076</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Support vector machines (SVMs) have been a dominant machine learning technique for more than a decade. The intuitive principle&#xd;
behind SVM training is to find the maximum margin separating hyperplane for a given set of binary labeled training data. Previously, SVMs have been primarily applied to supervised learning problems, where target class labels are provided with the&#xd;
data. Developing unsupervised extensions to SVMs, where no class labels are given, turns out to be a challenging problem. In&#xd;
this dissertation, I propose a principled approach for unsupervised and semi-supervised SVM training by formulating&#xd;
convex relaxations of the natural training criterion: find a (constrained) labeling that would yield an optimal SVM classifier&#xd;
on the resulting labeled training data. This relaxation yields a semidefinite program (SDP) that can be solved in polynomial time.&#xd;
The resulting training procedures can be applied to two-class and multi-class problems, and ultimately to the multivariate case, achieving high quality results in each case. In addition to unsupervised training, I also consider the problem of reducing the outlier sensitivity of standard supervised SVM training. Here I show that a similar convex relaxation can be applied to improve the robustness of SVMs by explicitly&#xd;
suppressing outliers in the training process. The proposed approach can achieve superior results to standard SVMs in the&#xd;
presence of outliers.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1645797 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Artificial Intelligence</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Machine Learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Support Vector Machines</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Convex Large Margin Training - Unsupervised, Semi-supervised, and Robust Support Vector Machines</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>