A Quasi-isometric Embedding Algorithm

09/06/2017
by   David W Dreisigmeyer, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/05/2018

Too many secants: a hierarchical approach to secant-based dimensionality reduction on large data sets

A fundamental question in many data analysis settings is the problem of ...
research
06/09/2020

Manifold structure in graph embeddings

Statistical analysis of a graph often starts with embedding, the process...
research
09/05/2022

Effective Estimation of the Dimensions of a Manifold from Random Samples

We give explicit theoretical and heuristical bounds for how big does a d...
research
12/16/2021

A new locally linear embedding scheme in light of Hessian eigenmap

We provide a new interpretation of Hessian locally linear embedding (HLL...
research
11/23/2018

Estimating of the inertial manifold dimension for a chaotic attractor of complex Ginzburg-Landau equation using a neural network

Dimension of an inertial manifold for a chaotic attractor of spatially d...
research
06/07/2021

Neurons on Amoebae

We apply methods of machine-learning, such as neural networks, manifold ...
research
04/06/2020

Parametrization of Neural Networks with Connected Abelian Lie Groups as Data Manifold

Neural nets have been used in an elusive number of scientific discipline...

Please sign up or login with your details

Forgot password? Click here to reset