Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/1538
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bhalachandra, Abhijit. | - |
dc.contributor.author | Gongopadhyay, Krishnendu | - |
dc.date.accessioned | 2021-12-08T16:39:13Z | - |
dc.date.available | 2021-12-08T16:39:13Z | - |
dc.date.issued | 2021-07-28 | - |
dc.identifier.uri | http://hdl.handle.net/123456789/1538 | - |
dc.description.abstract | The explosion of data has brought in the fervent need to analyze large and higher-dimensional datasets accurately and fast. Conventional tools are quickly becoming redundant when the focus is on the speed of computation and the expectations of impactful insight. There is a vibrant community of researchers who are looking at topology-based tools which are able to extract shape-pertinent features of these large datasets. Looking at alternate and non-classical tools has led to the development of some of the most impactful sub-fields of mathematics, one being Topological Data Analysis, which has been widely accepted and noticed for its effectiveness on certain use cases. This thesis will focus on studying a method called Persistent Homology, which in a sense forms the vein of Topological Data Analysis. This thesis will build mathematical theory to understand Persistent Homology, and subse- quently proceed to comment on contemporary challenges with regard to the method, and novel techniques to overcome them including algorithmic approaches with experimental observations. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | IISERM | en_US |
dc.subject | Homology | en_US |
dc.subject | Persistent | en_US |
dc.subject | Simplicial collapses | en_US |
dc.title | An Introduction to Persistent Homology and Simplicial Collapses | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | MS-16 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MS16035.docx | 12.23 kB | Microsoft Word XML | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.