Difference between revisions of "T-Distributed Stochastic Neighbor Embedding (t-SNE)"

From
Jump to: navigation, search
m
m
Line 18: Line 18:
 
* [[Principal Component Analysis (PCA)]] ...linear
 
* [[Principal Component Analysis (PCA)]] ...linear
 
* [http://projector.tensorflow.org/ Embedding Projector]
 
* [http://projector.tensorflow.org/ Embedding Projector]
 +
* [http://distill.pub/2016/misread-tsne/ How to Use t-SNE Effectively |]  [[Creatives#Martin Wattenberg |Martin Wattenberg]] - Distill
  
 
a machine learning algorithm for visualization developed by Laurens van der Maaten and [[Creatives#Geoffrey Hinton |Geoffrey Hinton]]. It is a nonlinear dimensionality reduction technique well-suited for embedding high-dimensional data for visualization in a low-dimensional space of two or three dimensions. Specifically, it models each high-dimensional object by a two- or three-dimensional point in such a way that similar objects are modeled by nearby points and dissimilar objects are modeled by distant points with high probability. [http://en.wikipedia.org/wiki/T-distributed_stochastic_neighbor_embedding Wikipedia]
 
a machine learning algorithm for visualization developed by Laurens van der Maaten and [[Creatives#Geoffrey Hinton |Geoffrey Hinton]]. It is a nonlinear dimensionality reduction technique well-suited for embedding high-dimensional data for visualization in a low-dimensional space of two or three dimensions. Specifically, it models each high-dimensional object by a two- or three-dimensional point in such a way that similar objects are modeled by nearby points and dissimilar objects are modeled by distant points with high probability. [http://en.wikipedia.org/wiki/T-distributed_stochastic_neighbor_embedding Wikipedia]
 +
  
 
<youtube>wvsE8jm1GzE</youtube>
 
<youtube>wvsE8jm1GzE</youtube>

Revision as of 13:22, 22 August 2020

Youtube search... ...Google search

a machine learning algorithm for visualization developed by Laurens van der Maaten and Geoffrey Hinton. It is a nonlinear dimensionality reduction technique well-suited for embedding high-dimensional data for visualization in a low-dimensional space of two or three dimensions. Specifically, it models each high-dimensional object by a two- or three-dimensional point in such a way that similar objects are modeled by nearby points and dissimilar objects are modeled by distant points with high probability. Wikipedia



1*RmG8qwjGGbp_CAXA8eDISQ.png