树状图的合并图及其稳定性
The mergegram of a dendrogram and its stability
摘要:
本文将拓扑数据分析(TDA)中的持久性概念扩展到一个新的方向。TDA量化隐藏在无序数据中的拓扑形状,例如无序点云。在0维的情况下,基于距离的持久性由度量空间中有限集的单链接(SL)聚类确定。同样,0D持久化只捕获最小生成树(MST)的边长。SL树状图和MST在点的扰动下都是不稳定的。我们定义了新的稳定的噪声下的合并图,它优于以前的等距不变量上的点云的分类,由Kellay。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。