Carlsson, Singh and Memoli's TDA mapper takes a point cloud dataset and outputs a graph that depends on several parameter choices. Dey, Memoli, and Wang developed Multiscale Mapper for abstract topological spaces so that parameter choices can be analyzed via persistent homology. However, when applied to actual data, one does not always obtain filtrations of mapper graphs. DBSCAN, one of the most common clustering algorithms used in the TDA mapper software, has two parameters, \textbf{$ε$} and \textbf{MinPts}. If \textbf{MinPts = 1} then DBSCAN is equivalent to single linkage clustering with cutting height \textbf{$ε$}. We show that if DBSCAN clustering is used with \textbf{MinPts $>$ 2}, a filtration of mapper graphs may not exist except in the absence of free-border points; but such filtrations exist if DBSCAN clustering is used with \textbf{MinPts = 1} or \textbf{2} as the cover size increases, \textbf{$ε$} increases, and/or \textbf{MinPts} decreases. However, the 1-dimensional filtration is unstable. If one adds noise to a data set so that each data point has been perturbed by a distance at most \textbf{$δ$}, the persistent homology of the mapper graph of the perturbed data set can be significantly different from that of the original data set. We show that we can obtain stability by increasing both the cover size and \textbf{$ε$} at the same time. In particular, we show that the bi-filtrations of the homology groups with respect to cover size and $ε$ between these two datasets are \textbf{2$δ$}-interleaved.
An Introduction to a New Text Classification and Visualization for Natural Language Processing Using Topological Data Analysis
Kharazmi University(哈拉兹米大学)
拓扑数据分析(Topological Data Analysis,TDA)是数据科学中一个新兴的快速发展的领域,它提供了一套新的拓扑和几何工具,用于从复杂的高维数据中提取相关特征。本文应用拓扑数据分析中的两种最好的方法--“持久同源”和“映射器”,对伊朗两位最优秀的诗人Ferdowsi和Hafez的波斯诗歌进行了分类。这篇文章有两个主要部分,在第一部分中,我们解释了这两种方法背后的数学,这对于普通观众来说很容易理解,在第二部分中,我们描述了我们的模型和将TDA工具应用于NLP的结果。