<?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-22T16:52:57Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/2926" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/2926</identifier><datestamp>2017-03-21T19:53:34Z</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" lang="en" authority="23b7cda6-4fd3-435e-b6fd-4a6c3dde3970" confidence="600">Whissell, John</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-05-08T14:01:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-05-08T14:01:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2006</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2006</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/2926</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In this thesis, we present a new clustering algorithm we call  &amp;lt;em&amp;gt;Significance Feature Clustering&amp;lt;/em&amp;gt;, which is designed to cluster  text documents.   Its central premise is the mapping of raw  frequency count vectors to discrete-valued significance vectors  which contain values of -1, 0, or 1.   These values represent  whether a word is &amp;lt;em&amp;gt;significantly negative&amp;lt;/em&amp;gt;,  &amp;lt;em&amp;gt;neutral&amp;lt;/em&amp;gt;, or  &amp;lt;em&amp;gt;significantly positive&amp;lt;/em&amp;gt;, respectively.   Initially, standard  tf-idf vectors are computed from raw frequency vectors, then these  tf-idf vectors are transformed to significance vectors using a  parameter alpha, where alpha controls the mapping -1, 0, or  1 for each vector entry.   SFC clusters agglomeratively, with each  document&amp;apos;s significance vector representing a cluster of size one  containing just the document, and iteratively merges the two  clusters that exhibit the most similar average using cosine  similarity.   We show that by using a good alpha value, the  significance vectors produced by SFC provide an accurate  indication of which words are significant to which documents, as  well as the type of significance, and therefore correspondingly  yield a good clustering in terms of a well-known definition of  clustering quality.   We further demonstrate that a user need not  manually select an alpha as we develop a new definition of  clustering quality that is highly correlated with text clustering  quality.   Our metric extends the family of metrics known as   &amp;lt;em&amp;gt;internal similarity&amp;lt;/em&amp;gt;, so that it can be applied to a tree of  clusters rather than a set, but it also factors in an aspect of  recall that was absent from previous internal similarity metrics.    Using this new definition of internal similarity, which we call  &amp;lt;em&amp;gt;maximum tree internal similarity&amp;lt;/em&amp;gt;, we show that a close to  optimal text clustering may be picked from any number of  clusterings created by different alpha&amp;apos;s.   The automatically  selected clusterings have qualities that are close to that of a  well-known and powerful hierarchical clustering algorithm.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">924191 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="rights" lang="en">Copyright: 2006, 
  Whissell, John. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">clustering</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">tf-idf vectors</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">data representations</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Significant Feature Clustering</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master 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">Master of Mathematics</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>