Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Reglajul fin BERT× | Pădurea Aleatoare (Random Forest)× | |
|---|---|---|
| Domeniu≠ | Învățare profundă | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2019 | 2001 |
| Autorul original≠ | Devlin, J. et al. | Breiman, L. |
| Tip≠ | Transfer learning (fine-tuning a pre-trained transformer) | Ensemble (bagging of decision trees) |
| Sursa seminală≠ | Devlin, J., Chang, M.-W., Lee, K. & Toutanova, K. (2019). BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. NAACL. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Denumiri alternative | BERT İnce Ayar (Fine-Tuning), BERT ince ayar, fine-tuning BERT, transfer learning with BERT | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Înrudite≠ | 5 | 4 |
| Rezumat≠ | BERT fine-tuning, building on the BERT model introduced by Devlin and colleagues in 2019, re-trains a pre-trained BERT model on a small labelled dataset for a target task such as classification, named-entity recognition, or question answering. Through transfer learning it reaches high performance even with relatively little task-specific data. | 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. |
| ScholarGateSet de date ↗ |
|
|