Sammenlign metoder

	Bayes-faktor test	Bayesiansk regression	Markov Chain Monte Carlo (MCMC)
Fagområde	Bayesiansk	Bayesiansk	Bayesiansk
Familie	Bayesian methods	Bayesian methods	Bayesian methods
Oprindelsesår	1961	—	—
Ophavsperson	Harold Jeffreys	—	—
Type	Bayesian hypothesis comparison	Bayesian linear model	Posterior sampling algorithm
Oprindelig kilde	Jeffreys, H. (1961). Theory of Probability (3rd ed.). Clarendon Press / Oxford University Press. ISBN: 978-0198503682	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
Aliasser	bayes factor, BF10, Bayesian hypothesis test, Bayes Faktörü — Hipotez Testi	bayesian linear regression, probabilistic regression, bayesian regresyon	markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo)
Relaterede	3	2	3
Resumé	The Bayes factor test, formalised by Harold Jeffreys in 1961, is a Bayesian method for comparing two competing hypotheses. Rather than returning a binary reject/retain verdict, it produces a continuous ratio BF₁₀ that quantifies how much more (or less) probable the data are under the alternative hypothesis H₁ than under the null hypothesis H₀.	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.