Prototype Selection Using Topological Data Analysis
Not on the map. Why?
Abstract (arXiv)
Prototype selection methods compress a training set, but the existing taxonomy of condensation, edition, hybrid, competence-based, optimization-based, and clustering-based families does not include methods that operate on the multi-scale topological structure of the data. This paper introduces two different persistence-based prototype selector variants, Topological Prototype Selector (TPS) and Boundary-Conscious Topological Prototype Selector (BoundaryTPS). TPS uses two sequential Rips filtrations to retain boundary-relevant and interior-typical points. BoundaryTPS is a single-stage variant whose vertex-weighted filtration concentrates retention near the decision boundary. We evaluate both methods against seven classical baselines on fifteen real datasets and find that the topological methods occupy a different operating point in the prototype-selection design space than existing methods. BoundaryTPS achieves the lowest mean Friedman rank on H1 persistence-diagram preservation and is significantly better than five of the seven baselines (Nemenyi, α = 0.05). TPS ranks third on the same endpoint. Both methods are more stable under fold perturbation than any chained-decision selector tested, and both inherit the source set's class proportions without label-aware machinery. On aggregate G-Mean both methods are competitive but not leading, with rank-1 frequencies of 11.3% (TPS) and 9.9% (BoundaryTPS) across fold combinations. Empirically, both methods scale sub-quadratically in sample size.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 79 references that are in the map. First posted on arXiv 6 Nov 2025.
Builds on
16 of 79 references.
References · 16
- 2014Distributed Representations of Sentences and Documentscited by 677
- 2015Persistence Images: A Stable Vector Representation of Persistent Homologycited by 235
- 2017An introduction to Topological Data Analysis: fundamental and practical aspects for data scientistscited by 171
- 2019Ripser: efficient computation of Vietoris-Rips persistence barcodescited by 115
- 2014A Stable Multi-Scale Kernel for Topological Machine Learningcited by 74
- 2023Topological Deep Learning: A Review of an Emerging Paradigmcited by 34
- 2014Dissimilarity-based Sparse Subset Selectioncited by 18
- 2018DTM-based Filtrationscited by 16
- 2021SPOT: A framework for selection of prototypes using optimal transportcited by 13
- 2019Classification of Imbalanced Data with a Geometric Digraph Familycited by 5
- 2025The Flood Complex: Large-Scale Persistent Homology on Millions of Pointscited by 5
- 2018Computing multiparameter persistent homology through a discrete Morse-based approachcited by 3
4 more
- 2023Singular value decomposition based matrix surgerycited by 3
- 2023Non-isotropic Persistent Homology: Leveraging the Metric Dependency of PHcited by 3
- 2019A topological data analysis based classification method for multiple measurementscited by 2
- 2021A Topological Data Analysis Based Classifiercited by 2
Built on by
Not cited yet.