<?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:05:56Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/25538" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/25538</identifier><datestamp>2026-09-24T22:57:48Z</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, Sharon M.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Nicas, Andrew J.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Tan, Anthony</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-07-17T19:13:27Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-07-17T19:13:27Z</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/25538</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/24931</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Persistent homology is a technique of topological data analysis that seeks to understand&#xd;
the shape of data. We study the effectiveness of a single-layer perceptron and gradient&#xd;
boosted classification trees in classifying perhaps the most well-known data set in machine learning, the MNIST-Digits, or MNIST. An alternative representation is constructed, called MNIST-PD. This construction captures the topology of the digits using persistence diagrams, a product of persistent homology. We show that the models are more effective when trained on MNIST compared to MNIST-PD. Promising evidence reveals that the topology is learned by&#xd;
the algorithms.</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">Master of Science (MSc)</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">Algebraic Topology</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Machine Learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Applied Topology</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Persistent Homology</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Persistent Homology and Machine Learning</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>