<?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-21T02:44:16Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/25359" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/25359</identifier><datestamp>2026-09-24T00:56:29Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">McNicholas, Paul David</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Gallaugher, Michael Patrick Brian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Mathematics and Statistics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-04-03T13:22:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-04-03T13:22:01Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2020</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/25359</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/11214</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Clustering and classification is the process of finding underlying group structure in heterogenous data. With the rise of the “big data” phenomenon, more complex data structures have made it so traditional clustering methods are oftentimes not advisable or feasible. This thesis presents methodology for analyzing three different examples of these more complex data types. The first is three-way (matrix variate) data, or data that come in the form of matrices. A large emphasis is placed on clustering skewed three-way data, and high dimensional three-way data. The second is click- stream data, which considers a user’s internet search patterns. Finally, co-clustering methodology is discussed for very high-dimensional two-way (multivariate) data. Parameter estimation for all these methods is based on the expectation maximization (EM) algorithm. Both simulated and real data are used for illustration.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">clustering, classification, mixture models, matrix variate distributions</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Analysis of Three-Way Data and Other Topics in Clustering and Classification</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>