विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| मल्टीवेरिएट एडप्टिव रिग्रेशन स्प्लाइन्स (MARS)× | ग्रेडिएंट बूस्टिंग× | रिग्रेशन और स्मूथिंग स्प्लाइन्स× | |
|---|---|---|---|
| क्षेत्र | मशीन अधिगम | मशीन अधिगम | मशीन अधिगम |
| परिवार | Machine learning | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1991 | 2001 | 1996 |
| प्रवर्तक≠ | Jerome H. Friedman | Friedman, J. H. | Spline regression literature; P-splines by Eilers & Marx |
| प्रकार≠ | Adaptive piecewise-linear regression | Ensemble (sequential boosting of decision trees) | Piecewise-polynomial nonparametric regression |
| मौलिक स्रोत≠ | 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 ↗ | Eilers, P. H. C., & Marx, B. D. (1996). Flexible smoothing with B-splines and penalties. Statistical Science, 11(2), 89–121. DOI ↗ |
| उपनाम≠ | 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 | splines, cubic splines, natural splines, smoothing splines |
| संबंधित≠ | 4 | 5 | 4 |
| सारांश≠ | 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. | 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. |
| ScholarGateडेटासेट ↗ |
|
|
|