השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| רגרסיה לינארית בייסיאנית× | שרשרת מרקוב מונטה קרלו (MCMC)× | |
|---|---|---|
| תחום | בייסיאני | בייסיאני |
| משפחה | Bayesian methods | Bayesian methods |
| שנת המקור≠ | 2013 (modern reference); foundations 18th–19th century | — |
| הוגה השיטה≠ | Thomas Bayes / Pierre-Simon Laplace (foundations); modern workflow codified by Gelman et al. | — |
| סוג≠ | 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 model, probabilistic linear regression, Bayesçi Doğrusal Regresyon | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| קשורות≠ | 4 | 3 |
| תקציר≠ | 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. | 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מערך נתונים ↗ |
|
|