Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Random Forest× | Rekurencyjna Sieć Neuronowa× | |
|---|---|---|
| Dziedzina≠ | Uczenie maszynowe | Uczenie głębokie |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 2001 | 1986–1990 |
| Twórca≠ | Breiman, L. | Rumelhart, D. E.; Elman, J. L. |
| Typ≠ | Ensemble (bagging of decision trees) | Sequential neural network |
| Źródło pierwotne≠ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Elman, J. L. (1990). Finding structure in time. Cognitive Science, 14(2), 179–211. DOI ↗ |
| Inne nazwy | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | RNN, Elman network, Jordan network, simple recurrent network |
| Pokrewne≠ | 4 | 3 |
| Podsumowanie≠ | 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. | A Recurrent Neural Network (RNN) is a class of neural network designed to process sequential data by maintaining a hidden state that carries information across time steps. Introduced in its modern form by Rumelhart et al. (1986) and further shaped by Elman (1990), RNNs became the dominant architecture for sequence modelling in NLP, speech, and time-series analysis before the rise of attention-based models. |
| ScholarGateZbiór danych ↗ |
|
|