Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Gated Recurrent Unit (GRU)× | Obousměrná rekurentní neuronová síť× | Random Forest× | |
|---|---|---|---|
| Obor≠ | Hluboké učení | Hluboké učení | Strojové učení |
| Rodina | Machine learning | Machine learning | Machine learning |
| Rok vzniku≠ | 2014 | 1997 | 2001 |
| Tvůrce≠ | Cho, K. et al. | Schuster, M. & Paliwal, K.K. | Breiman, L. |
| Typ≠ | Gated recurrent neural network unit | Recurrent neural network (sequence model) | Ensemble (bagging of decision trees) |
| Původní zdroj≠ | Cho, K. et al. (2014). Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation. EMNLP. link ↗ | Schuster, M. & Paliwal, K.K. (1997). Bidirectional Recurrent Neural Networks. IEEE Transactions on Signal Processing, 45(11), 2673–2681. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Další názvy≠ | Kapılı Tekrarlayan Birim (GRU), gated recurrent unit, gated recurrent network | Çift Yönlü RNN / BiLSTM / BiGRU, bidirectional recurrent neural network, BiLSTM, BiGRU | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Příbuzné≠ | 5 | 5 | 4 |
| Shrnutí≠ | The Gated Recurrent Unit (GRU) is a gated recurrent neural network cell introduced by Cho and colleagues in 2014 that captures long-range dependencies in sequential data using update and reset gates, achieving performance comparable to LSTM with fewer parameters. | A Bidirectional RNN, introduced by Schuster and Paliwal in 1997, processes a sequence in both forward and backward directions so that every position has access to its full surrounding context. With LSTM or GRU cells (BiLSTM/BiGRU) it is the standard approach for named-entity recognition, sequence labelling, and speech recognition. | 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. |
| ScholarGateDatová sada ↗ |
|
|
|