Topological Prototype Selector (TPS)

• TPS is a topological data analysis framework that uses persistent homology and bifiltration to extract representative prototypes from large datasets.
• It combines neighbor filtration for capturing class boundary features with radius filtration for intra-class refinement to ensure high classification fidelity.
• Empirical results show TPS significantly reduces data volume while boosting or maintaining accuracy across synthetic and real-world benchmarks.

The Topological Prototype Selector (TPS) constitutes a topological data analysis (TDA)-based framework for representative subset selection (prototype selection) from large datasets. TPS exploits persistent homology to identify data points that best capture both the intra-class topological “shape” and boundary-region separation between classes. By combining neighbor-based and radius-based filtrations in a bifiltration approach, TPS rigorously selects boundary-informative prototypes, tunable through geometric regularization parameters, and achieves substantial data reduction while preserving—often improving—classification accuracy across simulated and real-world tasks.

1. Prototype Selection and Topological Motivation

Given a labeled dataset $\mathcal{X} = \{(x_i, y_i)\}_{i=1}^n$, the principal challenge of prototype selection is to identify the smallest subset $\mathcal{S} \subset \mathcal{X}$ such that the classifier accuracy $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$ on validation data matches or exceeds full-data performance. Formally,

$$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$

Traditional distance-based heuristics (e.g., CNN, ENN), clustering (K-Means), or optimization (set cover) retain excessive internal or noisy points and are sensitive to instance order, lacking multiscale geometric robustness. TPS addresses these issues using TDA, leveraging persistent homology—a method robust to noise and high-dimensional structure—to quantify and extract the significant topological features at multiple scales, especially at class boundaries.

2. Mathematical Foundations of TPS

TPS operates on the data space $\mathcal{X} \subset X$, a metric space $(X, d)$. The approach constructs TDA objects, beginning with simplicial complexes:

• A $q$-simplex $\sigma$ is defined as the convex hull of $q+1$ affinely independent points.
• A simplicial complex $\mathcal{K}$ is a finite set of simplices closed under faces/intersections.

The Vietoris–Rips complex at scale $\mathcal{S} \subset \mathcal{X}$0,

$\mathcal{S} \subset \mathcal{X}$1

contains all simplices whose vertices are pairwise within $\mathcal{S} \subset \mathcal{X}$2. A filtration is a nested sequence of such complexes over increasing radii: $\mathcal{S} \subset \mathcal{X}$3 Persistent homology computes the birth and death ($\mathcal{S} \subset \mathcal{X}$4, $\mathcal{S} \subset \mathcal{X}$5) of $\mathcal{S} \subset \mathcal{X}$6-dimensional features (connected components, loops, voids), visualized in persistence diagrams $\mathcal{S} \subset \mathcal{X}$7.

The TPS central mechanism is bifiltration—using two parameters:

• Neighbor filtration (inter-class proximity, $\mathcal{S} \subset \mathcal{X}$8-axis)
• Radius filtration (intra-class connectivity, $\mathcal{S} \subset \mathcal{X}$9-axis)

A bifiltration $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$0 satisfies $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$1 whenever $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$2, $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$3. For a feature interval $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$4, its lifetime is $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$5.

3. Topological Prototype Selector Algorithm

TPS consists of two successive filtrations per class, formalized as follows:

3.1 Neighbor Filtration (Inter-Class)

1. Partition $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$6 into target class $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$7 and non-target $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$8.
2. For $\mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}})$9, compute sum of $$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$0 nearest neighbor distances in $$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$1,

$$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$2

1. Construct a weighted Rips complex with edge $$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$3 at $$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$4.
2. Compute $$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$5- and $$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$6-dimensional persistence ($$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$7); extract lifetimes $$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$8.
3. Remove lifetimes $$\min_{\mathcal{S} \subset \mathcal{X}} |\mathcal{S}| \quad \text{subject to} \quad \mathrm{Acc}(f_{\mathcal{S},\mathrm{Val}}) \approx \mathrm{Acc}(f_{\mathcal{X},\mathrm{Val}})$$9 (geometric regularization).
4. Choose quantile lifetime $\mathcal{X} \subset X$0.
5. Select slice index $\mathcal{X} \subset X$1 nearest to $\mathcal{X} \subset X$2.
6. Extract vertices $\mathcal{X} \subset X$3 at scale $\mathcal{X} \subset X$4.

3.2 Radius Filtration (Intra-Class)

1. Restrict to $\mathcal{X} \subset X$5.
2. For $\mathcal{X} \subset X$6, compute same-class radii,

$\mathcal{X} \subset X$7

1. Build Rips complex with edge $\mathcal{X} \subset X$8 at $\mathcal{X} \subset X$9.
2. Compute persistence $(X, d)$0; extract lifetimes $(X, d)$1.
3. Filter using $(X, d)$2.
4. Set $(X, d)$3.
5. Select slice $(X, d)$4 closest to $(X, d)$5.
6. Collect vertices $(X, d)$6 as prototypes for $(X, d)$7.

TPS implicitly solves

$(X, d)$8

Parallelization is achieved since the class selection loop is independent.

Algorithm Overview

Phase	Operation	Output
Neighbor filt	Rips + persistence	$(X, d)$9 (boundary)
Radius filt	Rips + persistence	$q$0 (prototypes)

4. Theoretical Guarantees and Computational Complexity

4.1 Complexity Analysis

With $q$1, constructing Rips up to maximum dimension $q$2 incurs $q$3 cost. Persistent homology (Ripser) practically executes in $q$4 to $q$5. TPS’s two computations per class yield total complexity

$q$6

Parameter $q$7 greatly influences combinatorial cost.

4.2 Stability

By the stability theorem for persistent homology, minor metric perturbations yield proportional changes in persistence diagrams, ensuring that the prototype set adapts smoothly to input noise.

4.3 Prototype Cardinality Bound

If $q$8 are Betti numbers at chosen slices,

$q$9

Thus, the number of prototypes is bounded by total Betti numbers.

5. Empirical and Practical Evaluation

5.1 Simulated Data

On nine synthetic 2D datasets (blobs, circles, moons, imbalanced scenarios), TPS demonstrates:

• Mean G-Mean improvement: $\sigma$0 (1-NN), $\sigma$1 (SVM).
• Data reduction rates: $\sigma$2 (1-NN), $\sigma$3 (SVM).

TPS typically preserves or enhances accuracy while retaining only 10–40% of original points.

5.2 Hyperparameter Effects

• $\sigma$4 (neighbor quantile) and $\sigma$5 (minimum persistence) regularize geometric structure, balancing reduction vs. performance.
• Smaller $\sigma$6 targets boundary topological features more effectively.

5.3 Computational Performance

• For $\sigma$7 points in $\sigma$8, TPS processes each class in $\sigma$9 seconds.
• Classwise parallelization achieves linear speedup.

5.4 Real Data Benchmarks

Across eight UCI datasets:

• TPS achieves average reduction $q+1$0, average G-Mean change $q+1$1.
• Outperforms CNN+ENN ($q+1$2), AllKNN ($q+1$3), and matches BienTib ($q+1$4) and K-Means, typically with fewer prototypes and lower runtime.

5.5 Metric Robustness

For text (Spam/Ham, Doc2Vec, $q+1$5):

• Under Euclidean metric: G-Mean $q+1$6 at $q+1$7 reduction.
• Under Cosine metric: G-Mean $q+1$8 at $q+1$9 reduction.

TPS leverages structure induced by different metric choices, outperforming purely distance-based alternatives.

6. Implementation Notes and Geometric Interpretation

• Ripser and GUDHI libraries efficiently compute Rips complexes and persistence for small $\mathcal{K}$0.
• Recommended pipeline: precompute distance matrix, process each class with neighbor → persistence → quantile selection, radius → persistence → mean selection, and extract required vertices.
• Geometric intuition:
  • Neighbor filtration identifies boundary/“thin” regions near other classes.
  • Radius filtration isolates “thick” intra-class zones near core features.
  • Their intersection selects topologically critical boundary exemplars.

7. Significance and Distinction

TPS is the first prototype selector fundamentally founded on TDA principles. Its bifiltration construction retains mathematically significant, boundary-informative points in a fashion that is parallelizable, interpretable, metric-flexible, and robust to noise. Unlike previous methods, TPS offers explicit geometric regularization through $\mathcal{K}$1 and $\mathcal{K}$2 settings, providing practitioners principled control over dataset reduction while maintaining high classification fidelity across a spectrum of domains.