DeepAI AI Chat
Log In Sign Up

Topological Machine Learning with Persistence Indicator Functions

by   Bastian Rieck, et al.
University of Heidelberg
Technische Universität Kaiserslautern

Techniques from computational topology, in particular persistent homology, are becoming increasingly relevant for data analysis. Their stable metrics permit the use of many distance-based data analysis methods, such as multidimensional scaling, while providing a firm theoretical ground. Many modern machine learning algorithms, however, are based on kernels. This paper presents persistence indicator functions (PIFs), which summarize persistence diagrams, i.e., feature descriptors in topological data analysis. PIFs can be calculated and compared in linear time and have many beneficial properties, such as the availability of a kernel-based similarity measure. We demonstrate their usage in common data analysis scenarios, such as confidence set estimation and classification of complex structured data.


A Persistent Homology Approach to Time Series Classification

Topological Data Analysis (TDA) is a rising field of computational topol...

A Kernel for Multi-Parameter Persistent Homology

Topological data analysis and its main method, persistent homology, prov...

RGB image-based data analysis via discrete Morse theory and persistent homology

Understanding and comparing images for the purposes of data analysis is ...

A topological classifier to characterize brain states: When shape matters more than variance

Despite the remarkable accuracies attained by machine learning classifie...

A topological data analysis based classification method for multiple measurements

Machine learning models for repeated measurements are limited. Using top...

TopoEmbedding, a web tool for the interactive analysis of persistent homology

Software libraries for Topological Data Analysis (TDA) offer limited sup...