방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 능동 학습 의사결정 트리× | 랜덤 포레스트× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1984–2010 | 2001 |
| 창시자≠ | Settles, B. (active learning framework); Breiman et al. (decision tree base) | Breiman, L. |
| 유형≠ | Active learning with decision tree base learner | Ensemble (bagging of decision trees) |
| 원전≠ | Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 별칭 | AL-DT, active decision tree, query-based decision tree learning, uncertainty-sampling decision tree | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 관련≠ | 5 | 4 |
| 요약≠ | Active learning with a decision tree combines the interpretable structure of a CART-style tree with a query strategy that selects the most informative unlabeled instances for human annotation. The model iteratively requests labels only for examples it is most uncertain about, minimising labeling cost while maximising classification accuracy on tabular 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. |
| ScholarGate데이터셋 ↗ |
|
|