방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이즈 비모수적 방법× | 마르코프 연쇄 몬테카를로 (MCMC)× | |
|---|---|---|
| 분야 | 베이지안 | 베이지안 |
| 계열 | Bayesian methods | Bayesian methods |
| 기원 연도≠ | 1973 (DP); 2006 (GP canonical text) | — |
| 창시자≠ | Ferguson (Dirichlet Process, 1973); Rasmussen & Williams (GP, 2006) | — |
| 유형≠ | Bayesian nonparametric model | Posterior sampling algorithm |
| 원전≠ | Rasmussen, C.E. & Williams, C.K.I. (2006). Gaussian Processes for Machine Learning. MIT Press. ISBN: 978-0262182539 | 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 |
| 별칭≠ | BNP, Dirichlet process mixture, DPM, Gaussian process regression | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| 관련 | 3 | 3 |
| 요약≠ | Bayesian nonparametric methods are a family of flexible Bayesian models in which model complexity is not fixed in advance but grows automatically with the data. The two most widely used members are the Dirichlet Process Mixture (DPM), which clusters observations without pre-specifying the number of clusters, and Gaussian Process (GP) regression, which places a prior directly over functions and performs regression or classification without committing to a parametric form. Both frameworks were formalised in the Bayesian nonparametric literature, with the canonical GP treatment given by Rasmussen and Williams (2006). | 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데이터셋 ↗ |
|
|