方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 用于模型比较的MCMC× | 马尔可夫链蒙特卡洛 (MCMC)× | |
|---|---|---|
| 领域 | 贝叶斯 | 贝叶斯 |
| 方法族 | Bayesian methods | Bayesian methods |
| 起源年份≠ | 1995 | — |
| 提出者≠ | Peter J. Green (reversible-jump MCMC); Meng & Wong (bridge sampling) | — |
| 类型≠ | Bayesian computational method | Posterior sampling algorithm |
| 开创性文献≠ | Green, P. J. (1995). Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika, 82(4), 711–732. DOI ↗ | 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 |
| 别名≠ | reversible-jump MCMC, RJMCMC, marginal likelihood estimation via MCMC, Bayesian model selection via MCMC | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| 相关≠ | 5 | 3 |
| 摘要≠ | MCMC for model comparison uses Markov chain Monte Carlo algorithms to estimate the marginal likelihoods and Bayes factors needed to formally compare competing statistical models. Techniques such as reversible-jump MCMC and bridge sampling allow exploration across model spaces of different dimensionality, enabling fully Bayesian model selection and averaging. | 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数据集 ↗ |
|
|