A higher-dimensional homologically persistent skeleton
From MaRDI portal
Abstract: Real data is often given as a point cloud, i.e. a finite set of points with pairwise distances between them. An important problem is to detect the topological shape of data --- for example, to approximate a point cloud by a low-dimensional non-linear subspace such as an embedded graph or a simplicial complex. Classical clustering methods and principal component analysis work well when given data points split into well-separated clusters or lie near linear subspaces of a Euclidean space. Methods from topological data analysis in general metric spaces detect more complicated patterns such as holes and voids that persist for a long time in a 1-parameter family of shapes associated to a cloud. These features can be visualized in the form of a 1-dimensional homologically persistent skeleton, which optimally extends a minimal spanning tree of a point cloud to a graph with cycles. We generalize this skeleton to higher dimensions and prove its optimality among all complexes that preserve topological features of data at any scale.
Recommendations
Cites work
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- Barcodes: The persistent topology of data
- Combinatorial optimization of cycles and bases
- Computational topology. An introduction
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- Hardness results for homology localization
- Minimum spanning acycle and lifetime of persistent homology in the Linial-Meshulam process
- On the local behavior of spaces of natural images
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Simplical Geometry and Transportation Polytopes
- Simplicial and cellular trees
- Topological pattern recognition for point cloud data
- Topological persistence and simplification
- Topology and data
Cited in
(10)- Networks beyond pairwise interactions: structure and dynamics
- A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space
- scientific article; zbMATH DE number 7306903 (Why is no real title available?)
- scientific article; zbMATH DE number 7559403 (Why is no real title available?)
- Topological properties of skeletal structures
- Inferring underlying manifold of data by the use of persistent homology analysis
- Hierarchies and Ranks for Persistence Pairs
- Local homology transfer and stratification learning
- Harmonic representatives in homology over arbitrary fields
- Scaffoldings and spines: organizing high-dimensional data using cover trees, local principal component analysis, and persistent homology
This page was built for publication: A higher-dimensional homologically persistent skeleton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1631454)