Isomap
≈ 2 min read
Names in other languages
- УкраїнськаІзовідображення
- daIsomap
- DeutschIsomap
- EnglishIsomap
- ItalianoIsomap
- 中文等距特征映射
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Isomap is a nonlinear dimensionality reduction method. It is one of several widely used low-dimensional embedding methods. 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.
How it works
Isomap is a nonlinear dimensionality reduction method. It is one of several widely used low-dimensional embedding methods. 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.
K = -\frac{1}{2} HD^2 H\, where D^2 = D^2_{ij}:=(D_{ij})^2 is the elementwise square of the geodesic distance matrix D = [D ij ], H is the centering matrix, given by H = I_n-\frac{1}{N} e_N e^T_N, \quad\text{where }e_N= [1\ \dots\ 1]^T \in \mathbb{R}^N. However, the kernel matrix K is not always positive semidefinite. The main idea for kernel Isomap is to make this K as a Mercer kernel matrix (that is positive semidefinite) using a constant-shifting method, in order to relate it to kernel PCA such that the generalization property naturally emerges.
The first who showed that Kernel PCA ~ manifold learning methods are Bengio et al. at Conference on Neural Information Processing Systems 2003 (NeurIPS'03).
Text derived from https://en.wikipedia.org/w/index.php?oldid=1304501185 under CC BY-SA 4.0; modifications have been made.