방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이즈 회귀× | 마르코프 연쇄 몬테카를로 (MCMC)× | |
|---|---|---|
| 분야 | 베이지안 | 베이지안 |
| 계열 | Bayesian methods | Bayesian methods |
| 기원 연도 | — | — |
| 창시자 | — | — |
| 유형≠ | Bayesian linear model | Posterior sampling algorithm |
| 원전 | 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 | 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 |
| 별칭 | bayesian linear regression, probabilistic regression, bayesian regresyon | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| 관련≠ | 2 | 3 |
| 요약≠ | Bayesian regression is a probabilistic version of linear regression that treats the model parameters as uncertain quantities. Instead of returning a single best-fit estimate, it combines prior knowledge with the observed data to produce a full posterior probability distribution for each parameter, from which credible intervals and predictions are read off. | Markov Chain Monte Carlo (MCMC) is a family of computational algorithms for sampling from complex probability distributions, most commonly the posterior distributions that arise in Bayesian inference. Rather than computing posteriors analytically — which is rarely possible for realistic models — MCMC constructs a Markov chain whose stationary distribution is the target posterior and draws dependent samples from it, enabling full probabilistic inference for virtually any model. |
| ScholarGate데이터셋 ↗ |
|
|