A subsample-and-average pipeline with rejection sampling and Procrustes alignment yields density-robust circular coordinates from persistent cohomology, validated on synthetic and C. elegans data.
Resampling and averaging coordinates on data
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We introduce algorithms for robustly computing intrinsic coordinates on point clouds. Our approach relies on generating many candidate coordinates by subsampling the data and varying hyperparameters of the embedding algorithm (e.g., manifold learning). We then identify a subset of representative embeddings by clustering the collection of candidate coordinates and using shape descriptors from topological data analysis. The final output is the embedding obtained as an average of the representative embeddings using generalized Procrustes analysis. We validate our algorithm on both synthetic data and experimental measurements from genomics, demonstrating robustness to noise and outliers.
citation-role summary
citation-polarity summary
fields
stat.ML 1years
2024 1verdicts
CONDITIONAL 1roles
method 1polarities
extend 1representative citing papers
citing papers explorer
-
Subsampling, aligning, and averaging to find circular coordinates in recurrent time series
A subsample-and-average pipeline with rejection sampling and Procrustes alignment yields density-robust circular coordinates from persistent cohomology, validated on synthetic and C. elegans data.