Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Τυχαίο Δάσος× | Αυτο-προσοχή πολλαπλών κεφαλών× | |
|---|---|---|
| Πεδίο≠ | Μηχανική Μάθηση | Βαθιά Μάθηση |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης≠ | 2001 | 2017 |
| Δημιουργός≠ | Breiman, L. | Vaswani, A. et al. |
| Τύπος≠ | Ensemble (bagging of decision trees) | Attention mechanism (Transformer core) |
| Θεμελιώδης πηγή≠ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Vaswani, A. et al. (2017). Attention Is All You Need. NeurIPS. link ↗ |
| Εναλλακτικές ονομασίες | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | Öz-Dikkat ve Çok Başlı Dikkat (Multi-Head Self-Attention), öz-dikkat, multi-head attention, scaled dot-product attention |
| Συναφείς≠ | 4 | 5 |
| Σύνοψη≠ | 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. | Multi-head self-attention, introduced by Vaswani and colleagues in 2017, is the mechanism that lets every position in a sequence compute its relationship to all other positions in parallel. It is the core of the Transformer architecture and the foundation underneath BERT, GPT, and T5. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|