Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Arbre de décision× | Gradient Boosting× | Splines de régression et de lissage× | |
|---|---|---|---|
| Domaine | Apprentissage automatique | Apprentissage automatique | Apprentissage automatique |
| Famille | Machine learning | Machine learning | Machine learning |
| Année d'origine≠ | 1984 | 2001 | 1996 |
| Auteur d'origine≠ | Breiman, Friedman, Olshen & Stone | Friedman, J. H. | Spline regression literature; P-splines by Eilers & Marx |
| Type≠ | Recursive partitioning (if-then rules) | Ensemble (sequential boosting of decision trees) | Piecewise-polynomial nonparametric regression |
| Source fondatrice≠ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Eilers, P. H. C., & Marx, B. D. (1996). Flexible smoothing with B-splines and penalties. Statistical Science, 11(2), 89–121. DOI ↗ |
| Alias≠ | 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 |
| Apparentées≠ | 5 | 5 | 4 |
| Résumé≠ | 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. |
| ScholarGateJeu de données ↗ |
|
|
|