Compară metode

	Spline-uri de regresie adaptative multivariate (MARS)	Arbore de decizie	Gradient Boosting	Spline-uri de regresie și de netezire
Domeniu	Învățare automată	Învățare automată	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning	Machine learning	Machine learning
Anul apariției	1991	1984	2001	1996
Autorul original	Jerome H. Friedman	Breiman, Friedman, Olshen & Stone	Friedman, J. H.	Spline regression literature; P-splines by Eilers & Marx
Tip	Adaptive piecewise-linear regression	Recursive partitioning (if-then rules)	Ensemble (sequential boosting of decision trees)	Piecewise-polynomial nonparametric regression
Sursa seminală	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.	Eilers, P. H. C., & Marx, B. D. (1996). Flexible smoothing with B-splines and penalties. Statistical Science, 11(2), 89–121.
Denumiri alternative	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	splines, cubic splines, natural splines, smoothing splines
Înrudite	4	5	5	4
Rezumat	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.	Regression splines model a nonlinear relationship by fitting piecewise polynomials that join smoothly at a set of points called knots. Cubic and natural splines are the most common, and smoothing splines add a roughness penalty that automatically balances fit against smoothness. Splines are the standard flexible building block for univariate nonlinear regression and the basis of generalized additive models.