REVIEW 1 cited by
Resampling and averaging coordinates on data
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.