Comparar métodos

	Isomap	Incrustación Lineal Local (LLE)	Máquina de Vectores de Soporte (Clasificación)
Campo	Aprendizaje automático	Aprendizaje automático	Aprendizaje automático
Familia	Latent structure	Machine learning	Machine learning
Año de origen	2000	2000	1995
Autor original	Tenenbaum, J. B.; de Silva, V.; Langford, J. C.	Sam Roweis & Lawrence Saul	Cortes, C. & Vapnik, V.
Tipo	Manifold learning / nonlinear dimensionality reduction	Nonlinear manifold dimensionality reduction	Maximum-margin classifier (kernel method)
Fuente seminal	Tenenbaum, J. B., de Silva, V. & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2319–2323.	Roweis, S. T., & Saul, L. K. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500), 2323–2326.	Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297.
Alias	Isomap, isometric feature mapping, geodesic Isomap, nonlinear MDS	LLE, manifold learning, nonlinear dimensionality reduction, yerel doğrusal gömme	Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier
Relacionados	3	3	5
Resumen	Isomap (Isometric Feature Mapping) is a manifold learning algorithm introduced by Tenenbaum, de Silva, and Langford in 2000 that discovers the intrinsic low-dimensional geometry of high-dimensional data by preserving geodesic — rather than straight-line Euclidean — distances between all pairs of points. It was one of the earliest, and most influential, nonlinear dimensionality reduction methods to demonstrate that genuinely curved data manifolds could be unfolded into a faithful low-dimensional coordinate system.	Locally linear embedding, introduced by Sam Roweis and Lawrence Saul in 2000, is a manifold-learning method for nonlinear dimensionality reduction. It assumes that although data may curve through a high-dimensional space, each point and its neighbours lie approximately on a flat patch. LLE captures each point as a weighted combination of its neighbours and then finds a low-dimensional layout that preserves those same local relationships, unrolling curved structure into a faithful low-dimensional map.	The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data.