手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| UMAP× | 因子分析× | ランダムフォレスト× | |
|---|---|---|---|
| 分野≠ | 機械学習 | 研究統計 | 機械学習 |
| 系統≠ | Machine learning | Process / pipeline | Machine learning |
| 提唱年≠ | 2018 | 1931 | 2001 |
| 提唱者≠ | McInnes, L.; Healy, J.; Melville, J. | Louis Leon Thurstone | Breiman, L. |
| 種類≠ | Nonlinear manifold-learning dimension reduction | Method | Ensemble (bagging of decision trees) |
| 原典≠ | McInnes, L., Healy, J. & Melville, J. (2018). UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. arXiv:1802.03426. link ↗ | Thurstone, L. L. (1947). Multiple Factor Analysis. University of Chicago Press. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 別名≠ | UMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reduction | EFA, CFA, latent variable modeling | 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. | Factor analysis is a statistical technique for identifying latent (unobserved) dimensions underlying observed variables, developed by Louis Leon Thurstone in the 1930s and formalized by Jöreskog (1969). Exploratory factor analysis (EFA) discovers unknown factor structure from data; confirmatory factor analysis (CFA) tests hypothesized relationships between observed and latent variables. Essential in psychometrics (test development), organizational research (measuring constructs like leadership style), and biomedicine (identifying disease subtypes), factor analysis reduces dimensionality while revealing conceptual organization in multivariate data. | 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. |
| ScholarGateデータセット ↗ |
|
|
|