ScholarGate
アシスタント

手法を比較

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

ロバストスタッキングアンサンブル×バギング(ブートストラップ集約)×ブースティング×
分野機械学習機械学習機械学習
系統Machine learningMachine learningMachine learning
提唱年1992 (stacking); robust variants 2000s–present19961990–1997
提唱者Wolpert, D. H. (stacking); robust extensions by multiple authorsBreiman, L.Schapire, R. E.; Freund, Y.
種類Ensemble (stacking with robust meta-learner)Ensemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)
原典Wolpert, D. H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗
別名robust stacking, robust stacked generalization, outlier-resistant stacking, stacking with robust meta-learnerBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
関連556
概要Robust Stacking Ensemble extends classical stacked generalization by replacing the ordinary meta-learner with a robust estimator — such as a Huber-loss regressor, quantile regression, or a model trained on trimmed residuals — so that the ensemble's combination layer is resistant to outliers and noisy base-learner predictions. It improves predictive accuracy and reliability on real-world datasets with contaminated labels or heavy-tailed error distributions.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.Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 3 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

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

ScholarGate手法を比較: Robust Stacking Ensemble · Bagging · Boosting. 2026-06-17に以下より取得 https://scholargate.app/ja/compare