เปรียบเทียบวิธี

	Kernel PCA	ออโตเอ็นโค้ดเดอร์	Isomap
สาขาวิชา	การเรียนรู้ของเครื่อง	การเรียนรู้เชิงลึก	การเรียนรู้ของเครื่อง
ตระกูล	Latent structure	Machine learning	Latent structure
ปีกำเนิด	1998	2006	2000
ผู้ริเริ่ม	Schölkopf, B.; Smola, A. J.; Müller, K.-R.	Hinton, G.E. & Salakhutdinov, R.R.	Tenenbaum, J. B.; de Silva, V.; Langford, J. C.
ประเภท	Nonlinear dimensionality reduction via kernel trick	Neural network (encoder-decoder)	Manifold learning / nonlinear dimensionality reduction
แหล่งต้นตำรับ	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.	Hinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507.	Tenenbaum, J. B., de Silva, V. & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2319–2323.
ชื่อเรียกอื่น	KPCA, kernel PCA, nonlinear PCA via kernel trick, kernel eigenvalue decomposition	Otokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder network	Isomap, isometric feature mapping, geodesic Isomap, nonlinear MDS
ที่เกี่ยวข้อง	5	4	3
สรุป	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.	An autoencoder is an encoder-decoder neural network, popularised by Hinton and Salakhutdinov in 2006, that compresses data into a low-dimensional latent code and then reconstructs it, enabling dimensionality reduction and anomaly detection. By learning to rebuild its own input through a narrow bottleneck, it discovers a compact representation of the data.	Isomap (Isometric Feature Mapping) is a manifold learning algorithm introduced by Tenenbaum, de Silva, and Langford in 2000 that discovers the intrinsic low-dimensional geometry of high-dimensional data by preserving geodesic — rather than straight-line Euclidean — distances between all pairs of points. It was one of the earliest, and most influential, nonlinear dimensionality reduction methods to demonstrate that genuinely curved data manifolds could be unfolded into a faithful low-dimensional coordinate system.