방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 능동 학습 지원 벡터 머신× | 랜덤 포레스트× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도 | 2001 | 2001 |
| 창시자≠ | Tong, S. & Koller, D. | Breiman, L. |
| 유형≠ | Active learning + kernel classifier | Ensemble (bagging of decision trees) |
| 원전≠ | Tong, S., & Koller, D. (2001). Support Vector Machine Active Learning with Applications to Text Classification. Journal of Machine Learning Research, 2, 45–66. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 별칭 | Active SVM, AL-SVM, SVM active learning, query-by-committee SVM | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 관련≠ | 3 | 4 |
| 요약≠ | Active learning SVM combines the strong decision-boundary of support vector machines with an intelligent query strategy that selects the most informative unlabeled instances for human annotation. Introduced by Tong and Koller in 2001, it achieves high classification accuracy using far fewer labeled examples than passive supervised learning, making it practical whenever labeling is expensive or slow. | 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데이터셋 ↗ |
|
|