kernelTDA: Statistical Learning with Kernel for Persistence Diagrams

Provides tools for exploiting topological information into standard statistical learning algorithms. To this aim, this package contains the most popular kernels defined on the space of persistence diagrams, and persistence images. Moreover, it provides a solver for kernel Support Vector Machines problems, whose kernels are not necessarily positive semidefinite, based on the C++ library 'LIBSVM' <>. Additionally, it allows to compute Wasserstein distance between persistence diagrams with an arbitrary ground metric, building an R interface for the C++ library 'HERA' <>.

Getting started

Package details

AuthorTullia Padellini [aut, cre], Francesco Palini [aut], Pierpaolo Brutti [ctb], Chih-Chung Chang [ctb, cph] (LIBSVM C++ code), Chih-Chen Lin [ctb, cph] (LIBSVM C++ code), Michael Kerber [ctb, cph] (HERA C++ code), Dmitriy Morozov [ctb, cph] (HERA C++ code), Arnur Nigmetov [ctb, cph] (HERA C++ code)
MaintainerTullia Padellini <>
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the kernelTDA package in your browser

Any scripts or data that you put into this service are public.

kernelTDA documentation built on April 19, 2020, 3:56 p.m.