Sammenlign metoder
Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.
| Nevral arkitektursøk× | Random Forest× | |
|---|---|---|
| Fagfelt≠ | Dyp læring | Maskinlæring |
| Familie | Machine learning | Machine learning |
| Opprinnelsesår≠ | 2017 | 2001 |
| Opphavsperson≠ | Zoph, B. & Le, Q.V. | Breiman, L. |
| Type≠ | Automated architecture optimization (deep learning) | Ensemble (bagging of decision trees) |
| Opprinnelig kilde≠ | Zoph, B. & Le, Q.V. (2017). Neural Architecture Search with Reinforcement Learning. ICLR. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Alias | Nöral Mimari Arama (NAS), NAS, automated architecture design, differentiable architecture search | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Relaterte≠ | 5 | 4 |
| Sammendrag≠ | Neural Architecture Search (NAS), introduced by Zoph and Le in 2017, automatically optimizes architectural decisions such as a network's depth, width, and connection structure instead of hand-designing them. Leading methods in the field include DARTS, ENAS, and Once-for-All. | 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. |
| ScholarGateDatasett ↗ |
|
|