ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

多元自适应回归样条 (MARS)×决策树×梯度提升(Gradient Boosting)×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份199119842001
提出者Jerome H. FriedmanBreiman, Friedman, Olshen & StoneFriedman, J. H.
类型Adaptive piecewise-linear regressionRecursive partitioning (if-then rules)Ensemble (sequential boosting of decision trees)
开创性文献Friedman, J. H. (1991). Multivariate adaptive regression splines. The Annals of Statistics, 19(1), 1–67. DOI ↗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 ↗
别名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 treeGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
相关455
摘要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.
ScholarGate数据集
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: MARS · Decision Tree · Gradient Boosting. 于 2026-06-18 检索自 https://scholargate.app/zh/compare