방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 로버스트 서포트 벡터 머신× | 로버스트 랜덤 포레스트× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2006–2009 | 2000s–2010s |
| 창시자≠ | Xu, H., Caramanis, C., & Mannor, S. | Various (extensions of Breiman 2001 Random Forest) |
| 유형≠ | Robust supervised classifier / regressor | Robust Ensemble (noise-tolerant bagging of decision trees) |
| 원전≠ | Xu, H., Caramanis, C., & Mannor, S. (2009). Robustness and regularization of support vector machines. Journal of Machine Learning Research, 10, 1485–1510. link ↗ | Chen, S., & Guestrin, C. (2019). Robust Random Forest. In Proceedings of the 36th International Conference on Machine Learning (ICML). Also see: Gao, W., & Zhou, Z.-H. (2013). On the Doubt about Margin Explanation of Boosting. Artificial Intelligence, 203, 1–18. link ↗ |
| 별칭 | Robust SVM, RSVM, noise-tolerant SVM, outlier-robust SVM | RRF, noise-robust random forest, outlier-resistant random forest, robust ensemble forest |
| 관련≠ | 5 | 6 |
| 요약≠ | Robust SVM extends the standard support vector machine to resist the influence of outliers and mislabeled points. By replacing the hinge loss with a bounded or non-convex loss function — or by incorporating robust optimization constraints — it learns a decision boundary that is far less distorted by corrupted training examples, making it suitable for noisy real-world datasets where standard SVM would degrade significantly. | Robust Random Forest extends the standard Random Forest ensemble by incorporating mechanisms that reduce the influence of outliers, label noise, and corrupted observations. Rather than treating all training instances equally, it applies weighting or filtering strategies so that noisy or anomalous samples contribute less to individual tree splits, yielding predictions that remain reliable even when data quality is imperfect. |
| ScholarGate데이터셋 ↗ |
|
|