ScholarGate
アシスタント

手法を比較

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

バギング(ブートストラップ集約)×ブースティング×ガウス過程×
分野機械学習機械学習機械学習
系統Machine learningMachine learningMachine learning
提唱年19961990–19972006 (book); roots in Kriging, 1951)
提唱者Breiman, L.Schapire, R. E.; Freund, Y.Rasmussen, C. E. & Williams, C. K. I.
種類Ensemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)Probabilistic non-parametric model
原典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 ↗Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0-262-18253-9
別名Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleGP, Gaussian Process Regression, GPR, Kriging
関連563
概要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.A Gaussian Process (GP) is a non-parametric, fully probabilistic machine learning model that places a prior distribution directly over functions. Rather than predicting a single value, it returns a predictive mean and a calibrated uncertainty estimate at every test point, making it especially valuable for regression on small to medium datasets and for Bayesian optimization tasks.
ScholarGateデータセット
  1. v1
  2. 3 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

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

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