ScholarGate
アシスタント

手法を比較

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

Extra Trees×バギング(ブートストラップ集約)×勾配ブースティング×
分野機械学習機械学習機械学習
系統Machine learningMachine learningMachine learning
提唱年200619962001
提唱者Geurts, P.; Ernst, D.; Wehenkel, L.Breiman, L.Friedman, J. H.
種類Ensemble (extremely randomized decision trees)Ensemble meta-algorithm (variance reduction via bootstrap aggregation)Ensemble (sequential boosting of decision trees)
原典Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
別名Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ETBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
関連555
概要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.Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.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. 2 出典
  3. PUBLISHED
  1. v1
  2. 3 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED

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

ScholarGate手法を比較: Extra Trees · Bagging · Gradient Boosting. 2026-06-18に以下より取得 https://scholargate.app/ja/compare