Abstract
dc:description.abstractPersistent 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.
Degree
thesis:*- Department dc:contributor.department
- Mathematics and Statistics
- Year dc:date.issued
- 2020
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Tan, Anthony
- Advisors dc:contributor.advisor
-
- McNicholas, Sharon M.
- Nicas, Andrew J.
Subjects
dc:subject × 4Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Identifier URI
- https://doi.org/10.71548/24931