2012/01/01 by Xu Liu, Zheng Xie, Dongyun Yi · 36 citations
Computer Science · Mathematics · #Topological and Geometric Data Analysis #Digital Image Processing Techniques #Homotopy and Cohomology in Algebraic Topology #Data structure #Computer science #Algorithm #Topology (electrical circuits) #Mathematics #Combinatorics
paper · pdf · doi:10.4310/hha.2012.v14.n1.a11
published in Homology Homotopy and Applications 14(1), 221-238 (Lehigh University)
openalex publication_date 2012/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26
Discovering and constructing the topological structure in data has attracted the attention within the community of data analysis. However, most methods developed so far are unsuitable for very large sets of data because of their computational difficulties. This paper presents a fast algorithm for constructing the inherent topological structure in large sets of data that might be noisy in order to enhance the MAPPER algorithm introduced by Singh, Mmoli and Carlsson. The limitation of our method, as shown by our experiments, lies with the storage in the main memory rather than the computing time.