手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| ベイズ線形回帰× | ランダムフォレスト× | |
|---|---|---|
| 分野≠ | ベイズ | 機械学習 |
| 系統≠ | Bayesian methods | Machine learning |
| 提唱年≠ | 2013 (modern reference); foundations 18th–19th century | 2001 |
| 提唱者≠ | Thomas Bayes / Pierre-Simon Laplace (foundations); modern workflow codified by Gelman et al. | Breiman, L. |
| 種類≠ | Bayesian linear model | Ensemble (bagging of decision trees) |
| 原典≠ | Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A. & Rubin, D. B. (2013). Bayesian Data Analysis (3rd ed.). CRC Press. ISBN: 978-1439840955 | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 別名≠ | bayesian linear model, probabilistic linear regression, Bayesçi Doğrusal Regresyon | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 関連 | 4 | 4 |
| 概要≠ | Bayesian linear regression is a probabilistic extension of the ordinary linear model, introduced through Bayes' rule and formalised in its modern computational workflow by Gelman et al. (2013). Rather than returning a single point estimate for each coefficient, it combines a user-specified prior distribution with the likelihood of the observed data to produce a full posterior distribution over all parameters, from which credible intervals and posterior predictive distributions are derived. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateデータセット ↗ |
|
|