Jämför metoder

	Beslutsträd	Support Vector Machine (Klassificering)	XGBoost
Ämnesområde	Maskininlärning	Maskininlärning	Maskininlärning
Familj	Machine learning	Machine learning	Machine learning
Ursprungsår	1984	1995	2016
Upphovsperson	Breiman, Friedman, Olshen & Stone	Cortes, C. & Vapnik, V.	Chen, T. & Guestrin, C.
Typ	Recursive partitioning (if-then rules)	Maximum-margin classifier (kernel method)	Ensemble (gradient-boosted decision trees)
Ursprungskälla	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
Alias	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier	XGBoost, extreme gradient boosting, scalable tree boosting
Närliggande	5	5	5
Sammanfattning	A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.	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.	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.