University of Cambridge > Talks.cam > Junior Geometry Seminar > The persistent homology of data

The persistent homology of data

Add to your list(s) Download to your calendar using vCal

  • UserNina Otter (Oxford) World_link
  • ClockFriday 12 May 2017, 15:00-16:00
  • HouseMR13.

If you have a question about this talk, please contact cbz20.

Topological data analysis (TDA) is a field that lies at the intersection of data analysis, algebraic topology, computational geometry, computer science, and statistics. The main goal of TDA is to use ideas and results from geometry and topology to develop tools for studying qualitative features of data. One of the most successful methods in TDA is persistent homology (PH), a method that stems from algebraic topology, and has been used in a variety of applications from different fields, including robotics, materials science, biology, and finance.

PH allows to study qualitative features of data across different values of a parameter, which one can think of as scales of resolution, and provides a summary of how long individual features persist across the different scales of resolution. In many applications, data depend not only on one, but several parameters, and to apply PH to such data one therefore needs to study the evolution of qualitative features across several parameters. While the theory of 1-parameter persistent homology is well understood, the theory of multi-parameter PH is hard, and it presents one of the biggest challenges of TDA .

In this talk I will first give an introduction to persistent homology; I will then discuss some applications, and the theoretical challenges in the multi-parameter case.

No prior knowledge on the subject is assumed. This talk is based on joint work with Heather Harrington, Henry Schenck, and Ulrike Tillmann.

This talk is part of the Junior Geometry Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity