{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/25538"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/25538","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Persistent Homology and Machine Learning","abstract":"Persistent homology is a technique of topological data analysis that seeks to understand the shape of data. We study the effectiveness of a single-layer perceptron and gradient 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 the algorithms.","abstract_html":"Persistent homology is a technique of topological data analysis that seeks to understand the shape of data. We study the effectiveness of a single-layer perceptron and gradient 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 the algorithms.","abstract_has_math":false,"creators":["Tan, Anthony"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Mathematics and Statistics","school":null,"contributors":[],"advisors":["McNicholas, Sharon M.","Nicas, Andrew J."],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020","date_published":"2020","updated_at":"2026-11-18T19:40:13Z","subjects":["Algebraic Topology","Machine Learning","Applied Topology","Persistent Homology"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/24931"],"render_values":[{"text":"https://doi.org/10.71548/24931","href":"https://doi.org/10.71548/24931","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/25538","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/25538","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F25538","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["McNicholas, Sharon M.","Nicas, Andrew J."]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics and Statistics"]},{"key":"dc:creator","label":"Author","values":["Tan, Anthony"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2020-07-17T19:13:27Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2020-07-17T19:13:27Z"]},{"key":"dc:date.issued","label":"Date","values":["2020"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Algebraic Topology","Machine Learning","Applied Topology","Persistent Homology"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/25538","https://doi.org/10.71548/24931"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Persistent homology is a technique of topological data analysis that seeks to understand the shape of data. We study the effectiveness of a single-layer perceptron and gradient 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 the algorithms."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science (MSc)"]},{"key":"dc:title","label":"Title","values":["Persistent Homology and Machine Learning"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["McNicholas, Sharon M.","Nicas, Andrew J."],"dc:contributor.department":["Mathematics and Statistics"],"dc:creator":["Tan, Anthony"],"dc:date.accessioned":["2020-07-17T19:13:27Z"],"dc:date.available":["2020-07-17T19:13:27Z"],"dc:date.issued":["2020"],"dc:description.abstract":["Persistent homology is a technique of topological data analysis that seeks to understand the shape of data. We study the effectiveness of a single-layer perceptron and gradient 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 the algorithms."],"dc:description.degree":["Master of Science (MSc)"],"dc:identifier.uri":["http://hdl.handle.net/11375/25538","https://doi.org/10.71548/24931"],"dc:language.iso":["en"],"dc:subject":["Algebraic Topology","Machine Learning","Applied Topology","Persistent Homology"],"dc:title":["Persistent Homology and Machine Learning"],"dc:type":["Thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:40:13Z"}