Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
16 views2 pages

Machine Learning Notes

The Topological Data Analysis (TDA) course for Autumn 2023-24 focuses on the study of data shapes through techniques like Persistent Homology, integrating concepts from computer science, mathematics, and statistics. Key topics include basics of topology, homology, persistent homology, and applications in machine learning and optimization. The course aims to equip students with algorithmic and mathematical tools for data analysis, with evaluations based on homework, final exams, and class participation.

Uploaded by

Shreya Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views2 pages

Machine Learning Notes

The Topological Data Analysis (TDA) course for Autumn 2023-24 focuses on the study of data shapes through techniques like Persistent Homology, integrating concepts from computer science, mathematics, and statistics. Key topics include basics of topology, homology, persistent homology, and applications in machine learning and optimization. The course aims to equip students with algorithmic and mathematical tools for data analysis, with evaluations based on homework, final exams, and class participation.

Uploaded by

Shreya Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Course-Code Topological Data Analysis

Autumn 2023-24

Course Summary

Broadly speaking, Topological Data Analysis (TDA) is the study of the shape of data. Given a point
cloud (set of points in a space), one can construct a combinatorial structure like graphs or simplicial
complexes etc based on certain relationships among the points and study the shape of the data or more
precisely the shape of “relationships” through various topological methods, like homology theory etc.
This is the main idea behind Persistent Homology, an important technique in TDA. The subject is at
the cross-road of topics from computer science, mathematics and statistics. More specifically, it is an
amalgam of Algorithms Design, Algebraic Topology, Geometry and more recently of Machine Learning
and Optimization etc. The goal of the course is to develop understanding of the various algorithmic,
mathematical and statistical tools and techniques used in the TDA pipeline and their usage in data
analysis.
Topics:

1. Basics Topology

(a) Topological spaces, metric space topology.


(b) Maps: homeomorphisms, homotopy equivalence, isotopy
(c) Cell complex and Manifolds.
(d) Simplicial Complex: Čech Complex, Vietoris-Rips Complex, Delaunay Complex etc.
(e) Simplicial maps: Inclusions and Contractions.

2. Homology

(a) Chains, boundaries, homology groups, betti numbers.


(b) Induced maps among homology groups.
(c) Cohomology groups.

3. Persistent Homology

(a) Filtrations, Persistent homology


(b) Persistence diagram and stabilty of persistence
(c) Persistence algorithms.

4. Other tools in TDA

(a) Nerves.
(b) Mapper.

5. Topological Machine Learning and Optimization

(a) Transforms of persistence diagram.


(b) Optimizing functions based on persistence.

6. Special Topics:

(a) Simplicial Collapse


(b) Discrete Morse Theory.
(c) Persistence on streaming graphs.

1
Outcome
After the first half of the course one should be able to understand the basics constructions like
simplicial complexes, homology and co-homology groups and persistence homology, and their compu-
tation. Towards the second half the emphasis is more on the applications of persistence homology and
its usage into Machine Learning and Optimizations. Finally, some special topics like simplicial collapse
and Discrete Morse theory will be introduced for more research oriented audience.

Reference books

• H. Edelsbrunner, J. Harer. Computational Topology: An Introduction. AMS Press, 2009.

• R. Ghrist: Elementary Applied Topology, ed. 1.0, Createspace, 2014.

• J-D. Boissonnat, F. Chazal and M. Yvinec: Geometric and Topological Inference. Cambridge
University Press, 2018.

Evaluation components

Homework/Assignments 40%
Final Exam 40%
Class participation,quizes 20%

You might also like