Порівняння методів

	t-SNE	Метод головних компонент
Галузь	Машинне навчання	Машинне навчання
Родина	Machine learning	Machine learning
Рік появи	2008	2002
Автор методу	van der Maaten, L. & Hinton, G.	Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
Тип	Nonlinear dimensionality reduction (manifold visualization)	Unsupervised dimensionality reduction
Основоположне джерело	van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605.	Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer.
Інші назви	t-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne	Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
Пов'язані	3	3
Підсумок	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.	Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures.