Persistent Homology with TDA4J

This will be a hands-on introduction to TDA4J, a Scala library for topological data analysis. We’ll start with a short review of persistent homology, then work through a few examples using the library: loading a point cloud, computing persistence, finding interesting features, and looking at representative cycles.

We’ll also try changing some of the options in the library and see how the results change. No Scala experience is required. Since this is intended to be an interactive tutorial, attendees should bring a laptop and be prepared to follow along.

Since TDA4J is still actively being developed, we’ll also use the session to get feedback on the library itself. Questions we’re hoping to answer: What was easy to figure out? What was confusing? What could be improved in the interface or documentation?