เปรียบเทียบวิธี
ดูวิธีที่เลือกเทียบกันแบบเคียงข้าง แถวที่ต่างกันจะถูกเน้นไว้
| Gibbs Sampling with Missing Data× | การสุ่มตัวอย่างแบบกิบบส์× | |
|---|---|---|
| สาขาวิชา | เบย์ | เบย์ |
| ตระกูล | Bayesian methods | Bayesian methods |
| ปีกำเนิด≠ | 1987–1990 | 1984 |
| ผู้ริเริ่ม≠ | Tanner & Wong (data augmentation), Gelfand & Smith (Gibbs sampler) | Stuart Geman & Donald Geman |
| ประเภท≠ | Bayesian computational method | MCMC sampling algorithm |
| แหล่งต้นตำรับ≠ | Tanner, M. A. & Wong, W. H. (1987). The calculation of posterior distributions by data augmentation. Journal of the American Statistical Association, 82(398), 528–540. DOI ↗ | Geman, S. & Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6), 721-741. DOI ↗ |
| ชื่อเรียกอื่น | data augmentation Gibbs sampler, Gibbs sampler with data augmentation, Bayesian imputation via Gibbs sampling, MCMC missing data imputation | Gibbs sampler, coordinate-wise MCMC, systematic scan Gibbs, blocked Gibbs sampling |
| ที่เกี่ยวข้อง≠ | 6 | 5 |
| สรุป≠ | Gibbs sampling with missing data treats unobserved values as additional unknowns alongside model parameters and samples all of them jointly within a Markov chain Monte Carlo loop. The method alternates between drawing the missing values from their conditional distribution given the parameters and drawing the parameters from their conditional distribution given the completed data, producing a posterior over both simultaneously. | Gibbs sampling is a Markov chain Monte Carlo algorithm that approximates a high-dimensional posterior distribution by repeatedly drawing each parameter from its full conditional distribution given all other parameters and the data. Because each draw is exact from a conditional — not a proposal that may be rejected — the sampler is efficient when those conditionals are available in closed form. |
| ScholarGateชุดข้อมูล ↗ |
|
|