Hierarchical topological clustering
Not on the map. Why?
Abstract (arXiv)
Topological methods have the potential of exploring data clouds without making assumptions on their the structure. Here we propose a hierarchical topological clustering algorithm that can be implemented with any distance choice. The persistence of outliers and clusters of arbitrary shape is inferred from the resulting hierarchy. We demonstrate the potential of the algorithm on selected datasets in which outliers play relevant roles, consisting of images, medical and economic data. These methods can provide meaningful clusters in situations in which other techniques fail to do so.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 4 of its 41 references that are in the map. First posted on arXiv 31 Dec 2025.
Builds on
4 of 41 references.
References · 4
- 2016Geometry Helps to Compare Persistence Diagramscited by 38
- 2018Towards a topological-geometrical theory of group equivariant non-expansive operators for data analysis and machine learningcited by 24
- 2021Fast Topological Clustering with Wasserstein Distancecited by 5
- 2018Multilevel Optimal Transport: a Fast Approximation of Wasserstein-1 distancescited by 4
Built on by
Not cited yet.