Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Analys av huvudkomponenter× | Random Forest× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2002 | 2001 |
| Upphovsperson≠ | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) | Breiman, L. |
| Typ≠ | Unsupervised dimensionality reduction | Ensemble (bagging of decision trees) |
| Ursprungskälla≠ | Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Alias | 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 |
| Närliggande≠ | 3 | 4 |
| Sammanfattning≠ | 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. |
| ScholarGateDatamängd ↗ |
|
|