Salīdzināt metodes

	Kodola PCA	Primārā komponentu analīze	t-SNE
Nozare	Mašīnmācīšanās	Mašīnmācīšanās	Mašīnmācīšanās
Saime	Latent structure	Machine learning	Machine learning
Izcelsmes gads	1998	2002	2008
Autors	Schölkopf, B.; Smola, A. J.; Müller, K.-R.	Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)	van der Maaten, L. & Hinton, G.
Tips	Nonlinear dimensionality reduction via kernel trick	Unsupervised dimensionality reduction	Nonlinear dimensionality reduction (manifold visualization)
Pirmavots	Schölkopf, B., Smola, A. J., & Müller, K.-R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5), 1299–1319.	Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer.	van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605.
Citi nosaukumi	KPCA, kernel PCA, nonlinear PCA via kernel trick, kernel eigenvalue decomposition	Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform	t-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne
Saistītās	5	3	3
Kopsavilkums	Kernel Principal Component Analysis (Kernel PCA) is a nonlinear dimensionality-reduction method introduced by Bernhard Schölkopf, Alexander Smola, and Klaus-Robert Müller in 1997–1998. It extends classical linear PCA to curved, non-linear data manifolds by implicitly mapping input data into a high-dimensional feature space via a kernel function, then performing standard PCA in that space — all without ever computing the mapping explicitly.	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.	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.