手法を比較

	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.