방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 능동 학습 부스팅× | 능동 학습 지원 벡터 머신× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1998 | 2001 |
| 창시자≠ | Abe, N. & Mamitsuka, H. | Tong, S. & Koller, D. |
| 유형≠ | Hybrid active-learning ensemble | Active learning + kernel classifier |
| 원전≠ | Abe, N. & Mamitsuka, H. (1998). Query Learning Strategies Using Boosting and Bagging. Proceedings of the 15th International Conference on Machine Learning (ICML 1998), pp. 1–9. Morgan Kaufmann. link ↗ | Tong, S., & Koller, D. (2001). Support Vector Machine Active Learning with Applications to Text Classification. Journal of Machine Learning Research, 2, 45–66. link ↗ |
| 별칭 | boosting-based active learning, query learning with boosting, active boosting, ensemble active learning | Active SVM, AL-SVM, SVM active learning, query-by-committee SVM |
| 관련≠ | 4 | 3 |
| 요약≠ | Active Learning Boosting combines the query-driven label acquisition of active learning with the weighted-ensemble logic of boosting algorithms such as AdaBoost. The model iteratively selects the most informative unlabeled examples to annotate — guided by the disagreement or uncertainty within the boosting ensemble — and retrains after each new label, achieving high accuracy with far fewer labeled examples than passive learning. | 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. |
| ScholarGate데이터셋 ↗ |
|
|