2020
DOI: 10.1007/s10462-020-09897-4
|View full text |Cite
|
Sign up to set email alerts
|

Persistence codebooks for topological data analysis

Abstract: Persistent homology is a rigorous mathematical theory that provides a robust descriptor of data in the form of persistence diagrams (PDs) which are 2D multisets of points. Their variable size makes them, however, difficult to combine with typical machine learning workflows. In this paper we introduce persistence codebooks, a novel expressive and discriminative fixed-size vectorized representation of PDs that adapts to the inherent sparsity of persistence diagrams. To this end, we adapt bag-of-words, vectors of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
12
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(13 citation statements)
references
References 45 publications
1
12
0
Order By: Relevance
“…In practice, such large change may not be significant if finer filtration intervals are chosen but to remedy the instability in the Betti sequence we propose a new stabilized version and prove its stability. In the stabilization, we adopt a similar Gaussian-smoothing approach as in [10,17]. In this paper, we show numerical examples that support our statement and show the validation of the proposed stabilization of the Betti sequence.…”
Section: Introductionsupporting
confidence: 66%
See 1 more Smart Citation
“…In practice, such large change may not be significant if finer filtration intervals are chosen but to remedy the instability in the Betti sequence we propose a new stabilized version and prove its stability. In the stabilization, we adopt a similar Gaussian-smoothing approach as in [10,17]. In this paper, we show numerical examples that support our statement and show the validation of the proposed stabilization of the Betti sequence.…”
Section: Introductionsupporting
confidence: 66%
“…We now propose a stabilized version of the Betti sequence inspired by the Gaussian smoothing techniques seen in [10,17] and prove its stability with respect to the 1-Wasserstein distance. Definition 3.1.…”
Section: Stablized Betti Sequencementioning
confidence: 99%
“…As a future direction, we will investigate more sophisticated methods for using ToFU in data augmentation, for example by using ToFU-VAE as a generative model to create training data with desired topological characteristics. Additionally, it will be beneficial to compare ToFU to a larger collection of TDA methods, for example sliced Wasserstein kernels [10] or persistence codebooks [49], on a larger repository of datasets.…”
Section: Variational Autoencodermentioning
confidence: 99%
“…Since the space of PDs lack a Hilbert space structure, they are not directly amenable to commonlyused statistical learning methods. A large body of work sought to remedy this shortcoming by inventing well-behaved Hilbert space representations of PDs [7,1,12,5,4,49]. Other works, notably [46] and [36], derive PD representations that serve as sufficient statistics, thereby ensuring that PD summaries retain all statistically-pertinent information for an inference task.…”
mentioning
confidence: 99%
“…For example, persistence landscapes (Bubenik, 2015) map persistence diagrams into a Banach space, specifically L p space. More examples include persistence image (Adams et al, 2017), generalized persistence landscapes (Berry et al, 2020), persistence path (Chevyrev et al, 2018), persistence codebook (Zelinski et al, 2020), persistence curves (Chung and Lawson, 2019), kernel based methods (Reininghaus et al, 2015;Kusano et al, 2016), and persistent entropy (Chintakunta et al, 2015;Atienza et al, 2019b). These methods have been studied and applied to different applications.…”
Section: Data Analysis With Persistence Diagram and Commonly Considermentioning
confidence: 99%