Adaptive Partitioning for Template Functions on Persistence Diagrams

@article{Tymochko2019AdaptivePF,
  title={Adaptive Partitioning for Template Functions on Persistence Diagrams},
  author={Sarah Tymochko and Elizabeth Munch and Firas A. Khasawneh},
  journal={2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA)},
  year={2019},
  pages={1227-1234}
}
As the field of Topological Data Analysis continues to show success in theory and in applications, there has been increasing interest in using tools from this field with methods for machine learning. Using persistent homology, specifically persistence diagrams, as inputs to machine learning techniques requires some mathematical creativity. The space of persistence diagrams does not have the desirable properties for machine learning, thus methods such as kernel methods and vectorization methods… Expand
Smooth Summaries of Persistence Diagrams and Texture Classification
TLDR
The statistical properties of Gaussian persistence curves are investigated and applied to texture datasets: UIUCTex and KTH and the classification results on these texture datasets perform competitively with the current state-of-arts methods in TDA. Expand
Teaspoon: A comprehensive python package for topological signal processing
TLDR
An overview of the python package teaspoon is presented, which brings together available software for computing persistent homology, the main workhorse of TDA, with modules that expand the functionality of teaspoon as a state-of-the-art topological signal processing tool. Expand

References

SHOWING 1-10 OF 26 REFERENCES
Approximating Continuous Functions on Persistence Diagrams Using Template Functions
TLDR
This paper describes a mathematical framework for featurizing the persistence diagram space using template functions, and discusses two example realizations of these functions: tent functions and Chybeyshev interpolating polynomials. Expand
Statistical Topological Data Analysis - A Kernel Perspective
TLDR
This work proves universality of a variant of the original kernel on persistence diagrams, and demonstrates its effective use in two-sample hypothesis testing on synthetic as well as real-world data. Expand
Kernel Method for Persistence Diagrams via Kernel Embedding and Weight Factor
TLDR
A kernel method on persistence diagrams is proposed that allows one to control the effect of persistence, and, if necessary, noisy topological properties can be discounted in data analysis. Expand
Persistence Images: A Stable Vector Representation of Persistent Homology
TLDR
This work converts a PD to a finite-dimensional vector representation which it is called a persistence image, and proves the stability of this transformation with respect to small perturbations in the inputs. Expand
Sliced Wasserstein Kernel for Persistence Diagrams
TLDR
A new kernel for PDs is defined, which is not only provably stable but also discriminative (with a bound depending on the number of points in the PDs) w.r.t. the first diagram distance between PDs. Expand
Persistence weighted Gaussian kernel for topological data analysis
TLDR
A kernel method on persistence diagrams is proposed to develop a statistical framework in TDA and satisfies the stability property and provides explicit control on the effect of persistence. Expand
A Riemannian Framework for Statistical Analysis of Topological Persistence Diagrams
TLDR
This paper proposes to use an entirely new framework built on Riemannian geometry, that models PDs as 2D probability density functions that are represented in the square-root framework on a Hilbert Sphere, that enables the use of existing machinery in differential geometry towards statistical analysis of PDs such as computing the mean, geodesics, classification etc. Expand
Persistence Fisher Kernel: A Riemannian Manifold Kernel for Persistence Diagrams
TLDR
This work relies upon the alternative Fisher information geometry to propose a positive definite kernel for PDs, namely the Persistence Fisher (PF) kernel, and derives generalization error bounds via covering numbers and Rademacher averages for kernel machines with the PF kernel. Expand
A User’s Guide to Topological Data Analysis
Topological data analysis (TDA) is a collection of powerful tools that can quantify shape and structure in data in order to answer questions from the data’s domain. This is done by representing someExpand
Statistical topological data analysis using persistence landscapes
  • Peter Bubenik
  • Mathematics, Computer Science
  • J. Mach. Learn. Res.
  • 2015
TLDR
A new topological summary for data that is easy to combine with tools from statistics and machine learning and obeys a strong law of large numbers and a central limit theorem is defined. Expand
...
1
2
3
...