Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| XGBoost× | Support Vector Machine (Classificazione)× | |
|---|---|---|
| Campo | Apprendimento automatico | Apprendimento automatico |
| Famiglia | Machine learning | Machine learning |
| Anno di origine≠ | 2016 | 1995 |
| Ideatore≠ | Chen, T. & Guestrin, C. | Cortes, C. & Vapnik, V. |
| Tipo≠ | Ensemble (gradient-boosted decision trees) | Maximum-margin classifier (kernel method) |
| Fonte seminale≠ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ | Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗ |
| Alias≠ | XGBoost, extreme gradient boosting, scalable tree boosting | Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier |
| Correlati | 5 | 5 |
| Sintesi≠ | XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions. | The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data. |
| ScholarGateInsieme di dati ↗ |
|
|