So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Bayesian Model Averaging× | Chuỗi Markov Monte Carlo (MCMC)× | |
|---|---|---|
| Lĩnh vực | Bayes | Bayes |
| Họ | Bayesian methods | Bayesian methods |
| Năm ra đời≠ | 1999 | — |
| Người khởi xướng≠ | Hoeting, Madigan, Raftery & Volinsky | — |
| Loại≠ | Bayesian model averaging | Posterior sampling algorithm |
| Công trình gốc≠ | Hoeting, J. A., Madigan, D., Raftery, A. E. & Volinsky, C. T. (1999). Bayesian Model Averaging: A Tutorial. Statistical Science, 14(4), 382–401. link ↗ | 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 |
| Tên gọi khác | BMA, Bayesian model combination, Bayesian Model Ortalaması (BMA) | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| Liên quan≠ | 5 | 3 |
| Tóm tắt≠ | Bayesian Model Averaging (BMA), formalised as a tutorial by Hoeting, Madigan, Raftery and Volinsky in 1999, addresses model uncertainty by averaging over all plausible model specifications rather than selecting a single best model. Each candidate model receives a posterior probability that reflects how well it fits the data given a prior, and predictions or coefficient estimates are formed as weighted averages across the entire model space. This approach reduces the bias and overconfidence that arise when a single selected model is treated as the true one. | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|