ScholarGate
アシスタント

手法を比較

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

決定木×Extra Trees×勾配ブースティング×
分野機械学習機械学習機械学習
系統Machine learningMachine learningMachine learning
提唱年198420062001
提唱者Breiman, Friedman, Olshen & StoneGeurts, P.; Ernst, D.; Wehenkel, L.Friedman, J. H.
種類Recursive partitioning (if-then rules)Ensemble (extremely randomized decision trees)Ensemble (sequential boosting of decision trees)
原典Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. 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 treeExtremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ETGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
関連555
概要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.Extra Trees (Extremely Randomized Trees), introduced by Geurts, Ernst, and Wehenkel in 2006, is an ensemble of decision trees that pushes randomisation further than Random Forest. Both the candidate features and the split thresholds are chosen completely at random at each node, eliminating the greedy search over thresholds. This extra randomness reduces variance, often matches or exceeds Random Forest accuracy, and runs substantially faster at training time.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 · Extra Trees · Gradient Boosting. 2026-06-17に以下より取得 https://scholargate.app/ja/compare