t-SNE编辑历史

t-distributed Stochastic Neighbor Embedding (t-SNE) is a nonlinear dimensionality reduction technique primarily used for visualizing high-dimensional data in a low-dimensional space, typically two or three dimensions. Developed by Laurens van der Maaten and Geoffrey Hinton in 2008, it improves upon Stochastic Neighbor Embedding by employing a Student‑t distribution in the low‑dimensional map to mitigate the crowding problem. t‑SNE converts pairwise similarities between data points into joint probabilities and minimizes the Kullback–Leibler divergence between the probability distributions of the high‑dimensional and low‑dimensional embeddings, making it especially effective at revealing local structure and clustering patterns.

## 1 Background

Dimensionality reduction is a fundamental task in data analysis, enabling the compression of high‑dimensional observations into a lower‑dimensional representation while preserving essential structure. The need arises from the curse of dimensionality and the desire to visualize complex datasets in two or three dimensions.

### 1.1 Dimensionality reduction overview

Dimensionality reduction methods can be broadly classified into linear techniques, such as Principal Component Analysis (PCA) and Multidimensional Scaling (MDS), and nonlinear techniques, such as Isomap, Locally Linear Embedding, autoencoders, and t‑SNE. The goal is to find a mapping from the original high‑dimensional space to a low‑dimensional space that retains meaningful properties of the data, often pairwise distances or neighborhood relationships.

### 1.2 Limitations of linear methods (e.g., PCA)

Linear methods project data onto a linear subspace, which is insufficient when the underlying data manifold is curved or contains complex cluster structures. PCA, for example, captures directions of maximum variance but cannot separate nonlinearly separable clusters. t‑SNE was designed specifically to overcome these limitations by preserving lo