Computed low-dimensional embedding through a path mapping algorithm by avoiding pairwise geodesic distances where the number of paths are lesser than data points. Produced results with improved time and memory complexity on synthetic and real-world datasets.
Computed low-dimensional embedding through a path mapping algorithm by avoiding pairwise geodesic distances where the number of paths are lesser than data points. Produced results with improved time and memory complexity on synthetic and real-world datasets.
tejatalluri/Nonlinear-Dimensionality-Reduction
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Computed low-dimensional embedding through a path mapping algorithm by avoiding pairwise geodesic distances where the number of paths are lesser than data points. Produced results with improved time and memory complexity on synthetic and real-world datasets.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published