방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 앙상블 서포트 벡터 머신× | 배깅 (Bootstrap Aggregating)× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2000–2003 | 1996 |
| 창시자≠ | Kim, H.-C. et al.; Dietterich, T. G. | Breiman, L. |
| 유형≠ | Ensemble of SVMs (bagging, voting, or stacking) | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) |
| 원전≠ | Kim, H.-C., Pang, S., Je, H.-M., Kim, D., & Bang, S. Y. (2002). Constructing support vector machine ensemble. Pattern Recognition, 36(12), 2757–2767. DOI ↗ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ |
| 별칭≠ | Ensemble SVM, SVM ensemble, bagged SVM, SVM committee machine | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor |
| 관련 | 5 | 5 |
| 요약≠ | Ensemble Support Vector Machine combines multiple independently trained SVM classifiers or regressors — each fitted on a different data partition, bootstrap sample, or feature subset — and aggregates their outputs via voting, averaging, or stacking. The approach mitigates the high computational cost and sensitivity to kernel hyperparameters inherent in a single large-scale SVM, while improving generalisation on complex or high-dimensional datasets. | Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner. |
| ScholarGate데이터셋 ↗ |
|
|