Difference between revisions of "Isomap"
| Line 11: | Line 11: | ||
* [[Kernel Approximation]] | * [[Kernel Approximation]] | ||
* [http://en.wikipedia.org/wiki/Isomap Isomap | Wikipedia] | * [http://en.wikipedia.org/wiki/Isomap Isomap | Wikipedia] | ||
| + | * [http://en.wikipedia.org/wiki/Nonlinear_dimensionality_reduction Nonlinear dimensionality reduction | Wikipedia] | ||
* [http://science.sciencemag.org/content/295/5552/7 The Isomap Algorithm and Topological Stability | M. Balasubramanian, E. Schwartz, J. Tenenbaum, Vin de Silva and J. Langford] | * [http://science.sciencemag.org/content/295/5552/7 The Isomap Algorithm and Topological Stability | M. Balasubramanian, E. Schwartz, J. Tenenbaum, Vin de Silva and J. Langford] | ||
Revision as of 18:31, 7 January 2019
YouTube search... ...Google search
- AI Solver
- ...find outliers
- Anomaly Detection
- Dimensional Reduction Algorithms
- Principal Component Analysis (PCA)
- T-Distributed Stochastic Neighbor Embedding (t-SNE)
- Local Linear Embedding (LLE)
- Kernel Approximation
- Isomap | Wikipedia
- Nonlinear dimensionality reduction | Wikipedia
- The Isomap Algorithm and Topological Stability | M. Balasubramanian, E. Schwartz, J. Tenenbaum, Vin de Silva and J. Langford
a nonlinear dimensionality reduction method. It is one of several widely used low-dimensional embedding methods.[1] Isomap is used for computing a quasi-isometric, low-dimensional embedding of a set of high-dimensional data points. The algorithm provides a simple method for estimating the intrinsic geometry of a data manifold based on a rough estimate of each data point’s neighbors on the manifold. Isomap is highly efficient and generally applicable to a broad range of data sources and dimensionalities.
