방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 랜덤 포레스트× | 다중 헤드 셀프 어텐션× | |
|---|---|---|
| 분야≠ | 머신러닝 | 딥러닝 |
| 계열 | 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데이터셋 ↗ |
|
|