Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Байесовская логистическая регрессия× | Метод Монте-Карло по цепям Маркова (MCMC)× | |
|---|---|---|
| Область | Байесовские методы | Байесовские методы |
| Семейство | Bayesian methods | Bayesian methods |
| Год появления≠ | 2008 | — |
| Автор метода≠ | Gelman, Jakulin, Pittau & Su (weakly-informative prior framework, 2008) | — |
| Тип≠ | Bayesian classification 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. 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 |
| Другие названия | bayesian binary logistic regression, bayesian classification model, Bayesian Lojistik Regresyon | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| Связанные | 3 | 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. | 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Набор данных ↗ |
|
|