Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Robustní Support Vector Machine× | Regularizovaný podpůrný vektorový stroj× | |
|---|---|---|
| Obor | Strojové učení | Strojové učení |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 2006–2009 | 1995–2004 |
| Tvůrce≠ | Xu, H., Caramanis, C., & Mannor, S. | Cortes, C. & Vapnik, V. (soft-margin SVM); Zhu et al. (L1-SVM) |
| Typ≠ | Robust supervised classifier / regressor | Regularized discriminative classifier / regressor |
| Původní zdroj≠ | Xu, H., Caramanis, C., & Mannor, S. (2009). Robustness and regularization of support vector machines. Journal of Machine Learning Research, 10, 1485–1510. link ↗ | Cortes, C. & Vapnik, V. (1995). Support-vector networks. Machine Learning, 20(3), 273–297. DOI ↗ |
| Další názvy | Robust SVM, RSVM, noise-tolerant SVM, outlier-robust SVM | Regularized SVM, L1-SVM, L2-SVM, penalized SVM |
| Příbuzné≠ | 5 | 4 |
| Shrnutí≠ | 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. | Regularized Support Vector Machine extends the classic SVM by explicitly controlling the trade-off between margin maximization and training error through an L1 or L2 penalty parameter. The soft-margin formulation introduced by Cortes and Vapnik in 1995 is itself a regularized model, and later L1-SVM variants additionally promote feature sparsity, enabling automatic variable selection in high-dimensional settings. |
| ScholarGateDatová sada ↗ |
|
|