Tampere University of Technology

TUTCRIS Research Portal

Metric Stabilization of Invariants for Topological Persistence

Research output: Book/ReportDoctoral thesisMonograph

Standard

Metric Stabilization of Invariants for Topological Persistence. / Riihimäki, Henri.

Tampere University, 2019. 120 p. (Tampere University Dissertations; Vol. 88).

Research output: Book/ReportDoctoral thesisMonograph

Harvard

Riihimäki, H 2019, Metric Stabilization of Invariants for Topological Persistence. Tampere University Dissertations, vol. 88, vol. 88, Tampere University.

APA

Riihimäki, H. (2019). Metric Stabilization of Invariants for Topological Persistence. (Tampere University Dissertations; Vol. 88). Tampere University.

Vancouver

Riihimäki H. Metric Stabilization of Invariants for Topological Persistence. Tampere University, 2019. 120 p. (Tampere University Dissertations).

Author

Riihimäki, Henri. / Metric Stabilization of Invariants for Topological Persistence. Tampere University, 2019. 120 p. (Tampere University Dissertations).

Bibtex - Download

@book{110a24ff42b7422b8644ddd91a9c1290,
title = "Metric Stabilization of Invariants for Topological Persistence",
abstract = "Rank or the minimal number of generators is a natural invariant attached to any n-dimensional persistent vector space. However, rank is highly unstable. Building an algorithmic framework for stabilizing the rank in one-dimensional persistence and proving its usefulness in concrete data analysis are the main objectives of this thesis. Studied stabilization process relies on choosing a pseudometric between tame persistent vector spaces. This allows to minimize the rank of a persistent vector space in larger and larger neighbourhoods around it with respect to the chosen pseudometric. The result is the stable rank invariant, a simple non-increasing function from non-negative reals to non-negative reals.We show how the needed pseudometrics arise from so called persistence contours. Contour is a certain function system which can be generated very efficiently and in implementable way by integrating a so called density function from non-negative reals to strictly positive reals. We prove an algorithmic way of computing the stable rank invariant with respect to a chosen contour. The result of the theoretical development is an embedding theorem showing that persistent vector spaces embed into Lebesgue measurable functions through stable rank.The success of persistent homology in data analysis has been largely due to the barcode decomposition and its efficient computation. One result of this thesis is that the barcode decomposition can be proved using the monotonicity of the rank with respect to taking a subspace of persistent vector space. This property of the rank only holds in one-dimensional case. We claim that rank is more fundamental for persistence and barcode is but a technical artifact of its properties. Even though barcode is a powerful tool, progress in persistence theory requires invariants generalizing to multi-dimensional persistence and not relying on decomposition theorems.Recent years have seen active research around mapping barcodes to some representation that enables statistics of results from persistent homology analysis and connects naturally to machine learning algorithms. Our embedding theorem shows that the stable rank provides a connection to machine learning. One of our main results is the full applicability of our pipeline in practical data analysis. We demonstrate how choosing an appropriate contour can enhance results of supervised learning. Contour can also be seen to act as a form of feature selection on the bar decomposition.",
author = "Henri Riihim{\"a}ki",
year = "2019",
month = "8",
day = "2",
language = "English",
isbn = "978-952-03-1152-0",
volume = "88",
series = "Tampere University Dissertations",
publisher = "Tampere University",

}

RIS (suitable for import to EndNote) - Download

TY - BOOK

T1 - Metric Stabilization of Invariants for Topological Persistence

AU - Riihimäki, Henri

PY - 2019/8/2

Y1 - 2019/8/2

N2 - Rank or the minimal number of generators is a natural invariant attached to any n-dimensional persistent vector space. However, rank is highly unstable. Building an algorithmic framework for stabilizing the rank in one-dimensional persistence and proving its usefulness in concrete data analysis are the main objectives of this thesis. Studied stabilization process relies on choosing a pseudometric between tame persistent vector spaces. This allows to minimize the rank of a persistent vector space in larger and larger neighbourhoods around it with respect to the chosen pseudometric. The result is the stable rank invariant, a simple non-increasing function from non-negative reals to non-negative reals.We show how the needed pseudometrics arise from so called persistence contours. Contour is a certain function system which can be generated very efficiently and in implementable way by integrating a so called density function from non-negative reals to strictly positive reals. We prove an algorithmic way of computing the stable rank invariant with respect to a chosen contour. The result of the theoretical development is an embedding theorem showing that persistent vector spaces embed into Lebesgue measurable functions through stable rank.The success of persistent homology in data analysis has been largely due to the barcode decomposition and its efficient computation. One result of this thesis is that the barcode decomposition can be proved using the monotonicity of the rank with respect to taking a subspace of persistent vector space. This property of the rank only holds in one-dimensional case. We claim that rank is more fundamental for persistence and barcode is but a technical artifact of its properties. Even though barcode is a powerful tool, progress in persistence theory requires invariants generalizing to multi-dimensional persistence and not relying on decomposition theorems.Recent years have seen active research around mapping barcodes to some representation that enables statistics of results from persistent homology analysis and connects naturally to machine learning algorithms. Our embedding theorem shows that the stable rank provides a connection to machine learning. One of our main results is the full applicability of our pipeline in practical data analysis. We demonstrate how choosing an appropriate contour can enhance results of supervised learning. Contour can also be seen to act as a form of feature selection on the bar decomposition.

AB - Rank or the minimal number of generators is a natural invariant attached to any n-dimensional persistent vector space. However, rank is highly unstable. Building an algorithmic framework for stabilizing the rank in one-dimensional persistence and proving its usefulness in concrete data analysis are the main objectives of this thesis. Studied stabilization process relies on choosing a pseudometric between tame persistent vector spaces. This allows to minimize the rank of a persistent vector space in larger and larger neighbourhoods around it with respect to the chosen pseudometric. The result is the stable rank invariant, a simple non-increasing function from non-negative reals to non-negative reals.We show how the needed pseudometrics arise from so called persistence contours. Contour is a certain function system which can be generated very efficiently and in implementable way by integrating a so called density function from non-negative reals to strictly positive reals. We prove an algorithmic way of computing the stable rank invariant with respect to a chosen contour. The result of the theoretical development is an embedding theorem showing that persistent vector spaces embed into Lebesgue measurable functions through stable rank.The success of persistent homology in data analysis has been largely due to the barcode decomposition and its efficient computation. One result of this thesis is that the barcode decomposition can be proved using the monotonicity of the rank with respect to taking a subspace of persistent vector space. This property of the rank only holds in one-dimensional case. We claim that rank is more fundamental for persistence and barcode is but a technical artifact of its properties. Even though barcode is a powerful tool, progress in persistence theory requires invariants generalizing to multi-dimensional persistence and not relying on decomposition theorems.Recent years have seen active research around mapping barcodes to some representation that enables statistics of results from persistent homology analysis and connects naturally to machine learning algorithms. Our embedding theorem shows that the stable rank provides a connection to machine learning. One of our main results is the full applicability of our pipeline in practical data analysis. We demonstrate how choosing an appropriate contour can enhance results of supervised learning. Contour can also be seen to act as a form of feature selection on the bar decomposition.

M3 - Doctoral thesis

SN - 978-952-03-1152-0

VL - 88

T3 - Tampere University Dissertations

BT - Metric Stabilization of Invariants for Topological Persistence

PB - Tampere University

ER -