방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 앙상블 전이 학습× | 랜덤 포레스트× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2010s | 2001 |
| 창시자≠ | Various (consolidated in deep learning era, 2010s) | Breiman, L. |
| 유형≠ | Ensemble of pre-trained / fine-tuned models | Ensemble (bagging of decision trees) |
| 원전≠ | Ganaie, M. A., Hu, M., Malik, A. K., Tanveer, M., & Suganthan, P. N. (2022). Ensemble deep learning: A review. Engineering Applications of Artificial Intelligence, 115, 105151. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 별칭 | transfer ensemble, multi-model transfer learning, ensemble of fine-tuned models, ETL | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 관련≠ | 6 | 4 |
| 요약≠ | Ensemble Transfer Learning combines multiple models that were each pre-trained on a large source domain and then fine-tuned on a target task. By aggregating the predictions of several independently fine-tuned models, it achieves higher accuracy and robustness than any single transferred model alone, especially when the target dataset is small. | 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데이터셋 ↗ |
|
|