Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Daudzvariāciju adaptīvās regresijas šķipsnas (MARS)× | Gradient Boosting× | |
|---|---|---|
| Nozare | Mašīnmācīšanās | Mašīnmācīšanās |
| Saime | Machine learning | Machine learning |
| Izcelsmes gads≠ | 1991 | 2001 |
| Autors≠ | Jerome H. Friedman | Friedman, J. H. |
| Tips≠ | Adaptive piecewise-linear regression | Ensemble (sequential boosting of decision trees) |
| Pirmavots≠ | Friedman, J. H. (1991). Multivariate adaptive regression splines. The Annals of Statistics, 19(1), 1–67. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| Citi nosaukumi | multivariate adaptive regression splines, earth algorithm, MARS regression, çok değişkenli uyarlamalı regresyon spline'ları | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| Saistītās≠ | 4 | 5 |
| Kopsavilkums≠ | 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. | 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. |
| ScholarGateDatu kopa ↗ |
|
|