Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Μετασχηματιστής (Επεξεργασία Φυσικής Γλώσσας)× | Τυχαίο Δάσος× | |
|---|---|---|
| Πεδίο≠ | Βαθιά Μάθηση | Μηχανική Μάθηση |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης≠ | 2017 | 2001 |
| Δημιουργός≠ | Vaswani, A. et al. | Breiman, L. |
| Τύπος≠ | Attention-based deep neural network | Ensemble (bagging of decision trees) |
| Θεμελιώδης πηγή≠ | Vaswani, A. et al. (2017). Attention Is All You Need. NeurIPS. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Εναλλακτικές ονομασίες | Transformer Modeli (NLP), attention-based language model, self-attention network, transformer NLP | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Συναφείς | 4 | 4 |
| Σύνοψη≠ | The Transformer is an attention-based deep learning model, introduced by Vaswani and colleagues in 2017, that performs text classification, named-entity recognition, and language modelling by letting every token in a sequence attend directly to every other token. It replaced earlier recurrent designs with a self-attention mechanism that processes whole sequences in parallel. | 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Σύνολο δεδομένων ↗ |
|
|