ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

決定木×一般化加法モデル(GAM)×勾配ブースティング×
分野機械学習機械学習機械学習
系統Machine learningMachine learningMachine learning
提唱年198419862001
提唱者Breiman, Friedman, Olshen & StoneTrevor Hastie & Robert TibshiraniFriedman, J. H.
種類Recursive partitioning (if-then rules)Semi-parametric additive regression modelEnsemble (sequential boosting of decision trees)
原典Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Hastie, T., & Tibshirani, R. (1986). Generalized additive models. Statistical Science, 1(3), 297–310. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
別名Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeGAM, additive model, spline-based additive regression, Genelleştirilmiş toplamsal modelGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
関連545
概要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.A generalized additive model, introduced by Trevor Hastie and Robert Tibshirani in 1986, extends the generalized linear model by replacing each linear term with a smooth, data-driven function of the predictor. This lets the model capture nonlinear relationships while preserving the additive, term-by-term interpretability of regression: each predictor contributes its own estimated curve, and the curves simply add up (on a link scale) to predict the response.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. 2 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Decision Tree · Generalized Additive Model · Gradient Boosting. 2026-06-18に以下より取得 https://scholargate.app/ja/compare