Vertaile menetelmiä

	Bayesilainen regressio	Markov-ketju-Monte Carlo (MCMC)	Harjanneregressio
Tieteenala	Bayesilainen tilastotiede	Bayesilainen tilastotiede	Koneoppiminen
Menetelmäperhe	Bayesian methods	Bayesian methods	Machine learning
Syntyvuosi	—	—	1970
Kehittäjä	—	—	Hoerl, A.E. & Kennard, R.W.
Tyyppi	Bayesian linear model	Posterior sampling algorithm	L2-regularized linear regression
Alkuperäislähde	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	Hoerl, A.E. & Kennard, R.W. (1970). Ridge Regression: Biased Estimation for Nonorthogonal Problems. Technometrics, 12(1), 55–67.
Rinnakkaisnimet	bayesian linear regression, probabilistic regression, bayesian regresyon	markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo)	Ridge Regresyonu, ridge regresyonu, L2-regularized regression, Tikhonov regularization
Liittyvät	2	3	4
Tiivistelmä	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.	Ridge Regression is an L2-regularized linear regression method, introduced by Arthur Hoerl and Robert Kennard in 1970, that reduces multicollinearity by adding a penalty on the size of the coefficients. It shrinks coefficients toward zero without setting any of them exactly to zero, producing more stable estimates when predictors are highly correlated.