Explore the application of Principal Component Analysis (PCA) to persistent homology rank functions in this insightful 57-minute lecture. Delve into topological summaries, rank functions, and persistence concepts while examining the weighted version of these techniques. Learn how to apply PCA to extract meaningful information from complex datasets and understand its stability through practical examples. Gain valuable insights into the intersection of algebraic topology and data analysis, presented by Katharine Turner for the Applied Algebraic Topology Network.
Katharine Turner - PCA of Persistent Homology Rank Functions with Case Studies
Applied Algebraic Topology Network via YouTube
Overview
Syllabus
Introduction
Topological summary
Check console
Rank function
Persistence
Choice interval
Weighted version
PCA
Example
Stability
Taught by
Applied Algebraic Topology Network
Related Courses
-
Computable Stability for Persistence Rank Function Machine Learning
-
From Persistent Homology to Machine Learning
-
Persistence in Functional Topology
-
An Introduction to Persistent Homology
-
Parallel Decomposition of Persistence Modules Through Interval Bases
-
Stabilizing the Unstable Output of Persistent Homology Computations
