方法对比

	贝叶斯逻辑回归	Bayesian Regression	马尔可夫链蒙特卡洛 (MCMC)
领域	贝叶斯	贝叶斯	贝叶斯
方法族	Bayesian methods	Bayesian methods	Bayesian methods
起源年份	2008	—	—
提出者	Gelman, Jakulin, Pittau & Su (weakly-informative prior framework, 2008)	—	—
类型	Bayesian classification model	Bayesian linear model	Posterior sampling algorithm
开创性文献	Gelman, A., Jakulin, A., Pittau, M. G. & Su, Y.-S. (2008). A Weakly Informative Default Prior Distribution for Logistic and Other Regression Models. Annals of Applied Statistics, 2(4), 1360–1383.	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 binary logistic regression, bayesian classification model, Bayesian Lojistik Regresyon	bayesian linear regression, probabilistic regression, bayesian regresyon	markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo)
相关	3	2	3
摘要	Bayesian logistic regression is a classification model that applies Bayesian inference to a logistic (sigmoid) likelihood for binary or multinomial outcomes. Developed within the weakly-informative prior framework formalised by Gelman, Jakulin, Pittau and Su (2008), it places a prior distribution over the coefficients and combines that prior with the data likelihood to yield a full posterior distribution for each parameter — delivering calibrated class probabilities and honest uncertainty even in small samples, rare-event settings, or cases of complete separation where frequentist maximum likelihood estimation collapses.	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.