License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2020.32
URN: urn:nbn:de:0030-drops-127281
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12728/
Elkin, Yury ;
Kurlin, Vitaliy
The Mergegram of a Dendrogram and Its Stability
Abstract
This paper extends the key concept of persistence within Topological Data Analysis (TDA) in a new direction. TDA quantifies topological shapes hidden in unorganized data such as clouds of unordered points. In the 0-dimensional case the distance-based persistence is determined by a single-linkage (SL) clustering of a finite set in a metric space. Equivalently, the 0D persistence captures only edge-lengths of a Minimum Spanning Tree (MST). Both SL dendrogram and MST are unstable under perturbations of points. We define the new stable-under-noise mergegram, which outperforms previous isometry invariants on a classification of point clouds by PersLay.
BibTeX - Entry
@InProceedings{elkin_et_al:LIPIcs:2020:12728,
author = {Yury Elkin and Vitaliy Kurlin},
title = {{The Mergegram of a Dendrogram and Its Stability}},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
pages = {32:1--32:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-159-7},
ISSN = {1868-8969},
year = {2020},
volume = {170},
editor = {Javier Esparza and Daniel Kr{\'a}ΔΎ},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12728},
URN = {urn:nbn:de:0030-drops-127281},
doi = {10.4230/LIPIcs.MFCS.2020.32},
annote = {Keywords: clustering dendrogram, topological data analysis, persistence, stability}
}
Keywords: |
|
clustering dendrogram, topological data analysis, persistence, stability |
Collection: |
|
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
18.08.2020 |
Supplementary Material: |
|
The initial C++ code for the mergregram is at https://github.com/YuryUoL/Mergegram and will be updated. |