השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| מודל רצף-לרצף× | יער אקראי× | |
|---|---|---|
| תחום≠ | למידה עמוקה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 2014 | 2001 |
| הוגה השיטה≠ | Sutskever, I.; Cho, K. | Breiman, L. |
| סוג≠ | Encoder-decoder neural network (deep learning) | Ensemble (bagging of decision trees) |
| מקור מכונן≠ | Sutskever, I., Vinyals, O. & Le, Q. V. (2014). Sequence to Sequence Learning with Neural Networks. NeurIPS. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| כינויים | Dizi-Dizi Modeli (Seq2Seq — Encoder-Decoder), encoder-decoder model, seq2seq, sequence to sequence learning | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| קשורות≠ | 5 | 4 |
| תקציר≠ | The sequence-to-sequence (Seq2Seq) model, introduced by Sutskever, Vinyals and Le and by Cho and colleagues in 2014, is an encoder-decoder neural network that maps a variable-length input sequence to a variable-length output sequence. It is the foundation of machine translation, text summarization, dialogue systems and code generation. | 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. |
| ScholarGateמערך נתונים ↗ |
|
|