Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Model Ierarhic Bayesian× | Metoda Monte Carlo cu Lanțuri Markov (MCMC)× | |
|---|---|---|
| Domeniu | Bayesian | Bayesian |
| Familie | Bayesian methods | Bayesian methods |
| Anul apariției≠ | 2006 | — |
| Autorul original≠ | Gelman & Hill (2006); Bayesian multilevel tradition | — |
| Tip≠ | hierarchical probabilistic model | Posterior sampling algorithm |
| Sursa seminală≠ | Gelman, A. & Hill, J. (2006). Data Analysis Using Regression and Multilevel/Hierarchical Models. Cambridge University Press. 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 |
| Denumiri alternative≠ | multilevel Bayes, Bayesian multilevel model, Bayesian HLM, partial pooling model | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| Înrudite≠ | 4 | 3 |
| Rezumat≠ | Bayesian hierarchical modelling, popularised by Gelman and Hill (2006), is a Bayesian approach to nested data structures — such as students within schools within districts — that estimates separate parameters at each level while allowing those levels to share statistical strength through a mechanism called partial pooling. Where a classical hierarchical linear model treats group means as fixed unknown quantities, the Bayesian version places hyperprior distributions on those group means so that information flows freely across levels, producing more reliable group-level estimates whenever any individual group has few observations. | 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. |
| ScholarGateSet de date ↗ |
|
|