Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Isomap× | t-SNE× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj≠ | Latent structure | Machine learning |
| Ursprungsår≠ | 2000 | 2008 |
| Upphovsperson≠ | Tenenbaum, J. B.; de Silva, V.; Langford, J. C. | van der Maaten, L. & Hinton, G. |
| Typ≠ | Manifold learning / nonlinear dimensionality reduction | Nonlinear dimensionality reduction (manifold visualization) |
| Ursprungskälla≠ | Tenenbaum, J. B., de Silva, V. & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2319–2323. DOI ↗ | van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605. link ↗ |
| Alias≠ | Isomap, isometric feature mapping, geodesic Isomap, nonlinear MDS | t-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne |
| Närliggande | 3 | 3 |
| Sammanfattning≠ | 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. | t-SNE (t-Distributed Stochastic Neighbor Embedding) is a nonlinear dimensionality-reduction method introduced by Laurens van der Maaten and Geoffrey Hinton in 2008 that maps high-dimensional data into a 2D or 3D space for visualization. It preserves probabilistic local similarities, so points that are neighbours in the original space stay close together, revealing cluster structure and local neighbourhoods. |
| ScholarGateDatamängd ↗ |
|
|