A computationally efficient framework for vector representation of persistence diagrams
In Topological Data Analysis, a common way of quantifying the shape of data is to use a persistence diagram (PD). PDs are multisets of points in $\mathbb{R}^2$ computed using tools of algebraic topology. However, this multi-set structure limits the utility of PDs in applications. Therefore, in recent years efforts have been directed towards extracting informative and efficient summaries from PDs to broaden the scope of their use for machine learning tasks. We propose a computationally efficient framework to convert a PD into a vector in $\mathbb{R}^n$, called a vectorized persistence block (VPB). We show that our representation possesses many of the desired properties of vector-based summaries such as stability with respect to input noise, low computational cost and flexibility. Through simulation studies, we demonstrate the effectiveness of VPBs in terms of performance and computational cost within various learning tasks, namely clustering, classification and change point detection.
Code (0)
등록된 구현이 없습니다.
Tasks
Change Point DetectionTopological Data AnalysisSimilar Papers 제목 키워드 기반
Comparing persistence diagrams through complex vectors
The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortuna…
General ClassificationRetrievalFrom Persistence to Survival: Hypothesis Testing, Effect Sizes and Vectorisation for Topological Features
Persistence diagrams are common representations in topological data analysis, but they do not naturally live in a vector space, and the statistical tools developed for comparing them have largely evolved separately from …
Unreduced Persistence Diagrams for Topological Machine Learning
Supervised machine learning pipelines trained on features derived from persistent homology have been experimentally observed to ignore much of the information contained in a persistence diagram. Computing persistence dia…
$k$-Means Clustering for Persistent Homology
Persistent homology is a methodology central to topological data analysis that extracts and summarizes the topological features within a dataset as a persistence diagram; it has recently gained much popularity from its m…
ClusteringTopological Data AnalysisVector Summaries of Persistence Diagrams for Permutation-based Hypothesis Testing
Over the past decade, the techniques of topological data analysis (TDA) have grown into prominence to describe the shape of data. In recent years, there has been increasing interest in developing statistical methods and …
Topological Data Analysis