[KongchangAI]
Conceptt-SNE / t-distributed Stochastic Neighbor Embedding

tSNE

A nonlinear dimensionality reduction and visualization algorithm that minimizes the KL divergence between high-dimensional and low-dimensional probability distributions, drawing similar samples together while pushing dissimilar ones apart. It is effective at revealing cluster-like local structures and is widely used for high-dimensional data visualization.

Timeline (last 90 days)

Oct 6

The author tried three dimensionality reduction methods—PCA, UMAP, and tSNE—and ultimately concluded that tSNE produced the best structure.

Unverified50%
Oct 6

The author simultaneously mapped the dimensionality reduction results to XYZ spatial coordinates and RGB color channels, making each font a colored point where proximity in both position and color represents similarity in visual features.

Unverified50%
Oct 6

tSNE is a nonlinear method that excels at preserving local neighborhood structures and revealing cluster structures, but the global distances between different clusters are not strictly comparable.

Unverified50%
Oct 6

UMAP differs from tSNE in its mathematical foundations, is faster, and preserves global structure better than tSNE.

Unverified50%
Oct 6

The map generated by the author using the Google Fonts corpus has an overall flower-like structure, with the model clustering most cursive/handwritten fonts toward the center of the flower.

Unverified50%

All Facts (5)

Source Articles