國立虎尾科技大學 |

Topological Data Analysis for Data Science : = The Delaunay-Rips Complex, Triangulation Stabilities, and Protein Stability Predictions.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Topological Data Analysis for Data Science :/
Reminder of title:	The Delaunay-Rips Complex, Triangulation Stabilities, and Protein Stability Predictions.
Author:	Mishra, Amish.
Description:	1 online resource (161 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 85-07, Section: B.
Contained By:	Dissertations Abstracts International85-07B.
Subject:	Mathematics. -
Online resource:	click for full text (PQDT)
ISBN:	9798381358988

Topological Data Analysis for Data Science : = The Delaunay-Rips Complex, Triangulation Stabilities, and Protein Stability Predictions.
Mishra, Amish.

Topological Data Analysis for Data Science :The Delaunay-Rips Complex, Triangulation Stabilities, and Protein Stability Predictions. - 1 online resource (161 pages)

Source: Dissertations Abstracts International, Volume: 85-07, Section: B.

Thesis (Ph.D.)--Florida Atlantic University, 2023.

Includes bibliographical references

Topological Data Analysis (TDA) is a relatively new field of research that utilizes topological notions to extract discriminating features from data. Within TDA, persistent homology (PH) is a robust method to compute multi-dimensional geometric and topological features of a dataset. Because these features are often stable under certain perturbations of the underlying data, are often discriminating, and can be used for visualization of structure in high-dimensional data and in statistical and machine learning modeling, PH has attracted the interest of researchers across scientific disciplines and in many industry applications. However, computational costs may present challenges to effectively using PH in certain data contexts, and theoretical stability results may not hold in practice. In this dissertation, we develop an algorithm that can reduce the computation burden of computing persistent homology on point cloud data. Naming it Delaunay-Rips (DR), we define, implement, and empirically test this computationally tractable simplicial complex construction for computing persistent homology of Euclidean point cloud data. We demonstrate the practical robustness of DR for persistent homology in comparison with other simplical complexes in machine learning applications such as predicting sleep state from patient heart rate. To justify the theoretical stability of DR, we prove the stability of the Delaunay triangulation of a pointcloud P under perturbations of the points of P. Specifically, we impose a notion of genericity on the points of P to ensure stability. In the final chapter, we contribute to the field of computational biology by taking a data-driven approach to learn topological features of designed proteins from their persistence diagrams. We find correlations between the learned topological features and biochemical features to investigate how protein structure relates to features identified by subject-matter experts. We train several machine learning models to assess the performance of incorporating topological features into training with biochemical features. Using cover-tree differencing via entropy reduction (CDER), we identify distinguishing regions of the persistence diagrams of stable/unstable proteins. More notably, we find statistically significant improvement in classification performance (in terms of average precision score) for certain designed secondary structure topologies.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798381358988Subjects--Topical Terms:

527692
Mathematics.
Subjects--Index Terms:

Data scienceIndex Terms--Genre/Form:

554714
Electronic books.

Topological Data Analysis for Data Science : = The Delaunay-Rips Complex, Triangulation Stabilities, and Protein Stability Predictions.
LDR:03938ntm a22004217 4500 001 1143031
005 20240513061049.5
006 m o d
007 cr mn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798381358988
035 $a (MiAaPQ)AAI30810841
035 $a AAI30810841
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Mishra, Amish. $3 1467596
245 1 0 $a Topological Data Analysis for Data Science : $b The Delaunay-Rips Complex, Triangulation Stabilities, and Protein Stability Predictions.
264 0 $c 2023
300 $a 1 online resource (161 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 85-07, Section: B.
500 $a Advisor: Motta, Francis.
502 $a Thesis (Ph.D.)--Florida Atlantic University, 2023.
504 $a Includes bibliographical references
520 $a Topological Data Analysis (TDA) is a relatively new field of research that utilizes topological notions to extract discriminating features from data. Within TDA, persistent homology (PH) is a robust method to compute multi-dimensional geometric and topological features of a dataset. Because these features are often stable under certain perturbations of the underlying data, are often discriminating, and can be used for visualization of structure in high-dimensional data and in statistical and machine learning modeling, PH has attracted the interest of researchers across scientific disciplines and in many industry applications. However, computational costs may present challenges to effectively using PH in certain data contexts, and theoretical stability results may not hold in practice. In this dissertation, we develop an algorithm that can reduce the computation burden of computing persistent homology on point cloud data. Naming it Delaunay-Rips (DR), we define, implement, and empirically test this computationally tractable simplicial complex construction for computing persistent homology of Euclidean point cloud data. We demonstrate the practical robustness of DR for persistent homology in comparison with other simplical complexes in machine learning applications such as predicting sleep state from patient heart rate. To justify the theoretical stability of DR, we prove the stability of the Delaunay triangulation of a pointcloud P under perturbations of the points of P. Specifically, we impose a notion of genericity on the points of P to ensure stability. In the final chapter, we contribute to the field of computational biology by taking a data-driven approach to learn topological features of designed proteins from their persistence diagrams. We find correlations between the learned topological features and biochemical features to investigate how protein structure relates to features identified by subject-matter experts. We train several machine learning models to assess the performance of incorporating topological features into training with biochemical features. Using cover-tree differencing via entropy reduction (CDER), we identify distinguishing regions of the persistence diagrams of stable/unstable proteins. More notably, we find statistically significant improvement in classification performance (in terms of average precision score) for certain designed secondary structure topologies.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Mathematics. $3 527692
650 4 $a Computer science. $3 573171
650 4 $a Biochemistry. $3 582831
653 $a Data science
653 $a Persistence diagram
653 $a Persistent homology
653 $a Protein stability
653 $a Simplicial complex
653 $a Topological data analysis
655 7 $a Electronic books. $2 local $3 554714
690 $a 0405
690 $a 0984
690 $a 0487
690 $a 0800
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Florida Atlantic University. $b Mathematics. $3 1467597
773 0 $t Dissertations Abstracts International $g 85-07B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30810841 $z click for full text (PQDT)