pith. sign in

arxiv: 1709.01972 · v3 · pith:KTAYK6VMnew · submitted 2017-09-06 · 📊 stat.ML · cs.CG· cs.LG

A Quasi-isometric Embedding Algorithm

classification 📊 stat.ML cs.CGcs.LG
keywords embeddingmanifoldalgorithmdatadimensionprojectionbounddistorts
0
0 comments X
read the original abstract

The Whitney embedding theorem gives an upper bound on the smallest embedding dimension of a manifold. If a data set lies on a manifold, a random projection into this reduced dimension will retain the manifold structure. Here we present an algorithm to find a projection that distorts the data as little as possible.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.