Persistence kernels for classification: A comparative study

Cinzia Bandiziol, Stefano De Marchi
8/9/2024
cs.LGmath.AT

No confident code implementation found for this paper.

Abstract

The aim of the present work is a comparative study of different persistence kernels applied to various classification problems. After some necessary preliminaries on homology and persistence diagrams, we introduce five different kernels that are then used to compare their performances of classification on various datasets. We also provide the Python codes for the reproducibility of results.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Persistence Spheres: Bi-continuous Representations of Persistence Diagrams

78% match2025

A Topological Machine Learning Pipeline for Classification

78% match2023

Persistence Images: A Stable Vector Representation of Persistent Homology

78% match1 repo472015

GEFL: Extended Filtration Learning for Graph Classification

77% match1 repo52024

Persistent Classification: A New Approach to Stability of Data and Adversarial Examples

77% match2024

A Primer on Topological Data Analysis to Support Image Analysis Tasks in Environmental Science

75% match1 repo102022

Cite this paper

@article{bandiziol2024persistence,
  title  = {Persistence kernels for classification: A comparative study},
  author = {Cinzia Bandiziol and Stefano De Marchi},
  year   = {2024},
  eprint = {2408.07090},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.07090v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.07090.svg)](https://codeofpaper.com/paper/2408.07090)

Discussion