Comparer des méthodes

	Splines adaptatives multivariées (MARS)	Arbre de décision	Gradient Boosting
Domaine	Apprentissage automatique	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning	Machine learning
Année d'origine	1991	1984	2001
Auteur d'origine	Jerome H. Friedman	Breiman, Friedman, Olshen & Stone	Friedman, J. H.
Type	Adaptive piecewise-linear regression	Recursive partitioning (if-then rules)	Ensemble (sequential boosting of decision trees)
Source fondatrice	Friedman, J. H. (1991). Multivariate adaptive regression splines. The Annals of Statistics, 19(1), 1–67.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
Alias	multivariate adaptive regression splines, earth algorithm, MARS regression, çok değişkenli uyarlamalı regresyon spline'ları	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Apparentées	4	5	5
Résumé	Multivariate adaptive regression splines, introduced by Jerome Friedman in 1991, is a flexible nonparametric regression method that automatically models nonlinearities and interactions by combining piecewise-linear 'hinge' functions. It builds the model in a forward stagewise pass that adds basis functions where they help most, then prunes back the overgrown model, yielding an interpretable additive-plus-interaction form that adapts its complexity to the data.	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.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.