方法对比

	UMAP	主成分分析	随机森林
领域	机器学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning
起源年份	2018	2002	2001
提出者	McInnes, L.; Healy, J.; Melville, J.	Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)	Breiman, L.
类型	Nonlinear manifold-learning dimension reduction	Unsupervised dimensionality reduction	Ensemble (bagging of decision trees)
开创性文献	McInnes, L., Healy, J. & Melville, J. (2018). UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. arXiv:1802.03426.	Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
别名	UMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reduction	Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关	5	3	4
摘要	UMAP (Uniform Manifold Approximation and Projection) is a fast, scalable nonlinear dimension-reduction method grounded in manifold-learning theory, introduced by McInnes, Healy and Melville in 2018. It compresses high-dimensional data into a low-dimensional embedding for visualisation and downstream analysis.	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.