Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Analiza Discriminantă Liniară (LDA)× | Pădurea Aleatoare (Random Forest)× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie≠ | Latent structure | Machine learning |
| Anul apariției≠ | 1936 | 2001 |
| Autorul original≠ | Fisher, R. A. | Breiman, L. |
| Tip≠ | Supervised dimensionality reduction and linear classifier | Ensemble (bagging of decision trees) |
| Sursa seminală≠ | Fisher, R. A. (1936). The use of multiple measurements in taxonomic problems. Annals of Eugenics, 7(2), 179–188. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Denumiri alternative≠ | LDA, Fisher's discriminant analysis, Fisher linear discriminant, normal discriminant analysis | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Înrudite | 4 | 4 |
| Rezumat≠ | Linear Discriminant Analysis is a supervised method for dimensionality reduction and classification, introduced by Ronald A. Fisher in 1936, that finds linear combinations of features which maximally separate predefined classes while preserving as much class-discriminatory information as possible. It simultaneously serves as a feature-projection technique and a probabilistic classifier, making it one of the foundational methods in pattern recognition and statistical learning. | 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. |
| ScholarGateSet de date ↗ |
|
|