<?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-22T15:41:14Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4031" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4031</identifier><datestamp>2017-03-21T16:47:04Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9914</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="618cfa0b-f31b-4e86-82de-e152aeedc911" confidence="600">Ahmadi, Abbas</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-09-24T20:23:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-09-24T20:23:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-09-24T20:23:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2008</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4031</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Exploring a set of unlabeled data to extract the similar clusters,&#xd;
known as data clustering, is an appealing problem in machine&#xd;
learning. In other words, data clustering organizes the underlying&#xd;
data into different groups using a notion of similarity between&#xd;
patterns.&#xd;
&#xd;
A new approach to solve the data clustering problem based on&#xd;
multiple cooperative swarms is introduced. The proposed approach is&#xd;
inspired by the social swarming behavior of biological bird flocks&#xd;
which search for food situated in several places. The proposed&#xd;
approach is composed of two main phases, namely, initialization and&#xd;
exploitation. In the initialization phase, the aim is to distribute&#xd;
the search space among several swarms. That is, a part of the search&#xd;
space is assigned to each swarm in this phase. In the exploitation&#xd;
phase, each swarm searches for the center of its associated cluster&#xd;
while cooperating with other swarms. The search proceeds to converge&#xd;
to a near-optimal solution. As compared to the single swarm&#xd;
clustering approach, the proposed multiple cooperative swarms&#xd;
provide better solutions in terms of fitness function measure for&#xd;
the cluster centers, as the dimensionality of data and number of&#xd;
clusters increase.&#xd;
&#xd;
&#xd;
The multiple cooperative swarms clustering approach assumes that the&#xd;
number of clusters is known a priori. The notion of stability&#xd;
analysis is proposed to extract the number of clusters for the&#xd;
underlying data using multiple cooperative swarms. The mathematical&#xd;
explanations demonstrating why the proposed approach leads to more&#xd;
stable and robust results than those of the single swarm clustering&#xd;
are also provided.&#xd;
&#xd;
&#xd;
Application of the proposed multiple cooperative swarms clustering&#xd;
is considered for one of the most challenging problems in speech&#xd;
recognition: phoneme recognition. The proposed approach is used to&#xd;
decompose the recognition task into a number of subtasks or modules.&#xd;
Each module involves a set of similar phonemes known as a phoneme&#xd;
family. Basically, the goal is to obtain the best solution for&#xd;
phoneme families using the proposed multiple cooperative swarms&#xd;
clustering. The experiments using the standard TIMIT corpus indicate&#xd;
that using the proposed clustering approach boosts the accuracy of&#xd;
the modular approach for phoneme recognition considerably.</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">Data clustering</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Swarm intelligence</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Particle swarm optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Cooperative swarms</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">System Design Engineering</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Multiple Cooperative Swarms for Data Clustering</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">Systems Design Engineering</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>