Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Penapis Zarah (Monte Carlo Sekuen)× | Markov Chain Monte Carlo (MCMC)× | |
|---|---|---|
| Bidang | Bayesian | Bayesian |
| Keluarga | Bayesian methods | Bayesian methods |
| Tahun asal≠ | 1993 | — |
| Pengasas≠ | Gordon, Salmond & Smith | — |
| Jenis≠ | Sequential Monte Carlo estimator | Posterior sampling algorithm |
| Sumber perintis≠ | Gordon, N. J., Salmond, D. J., & Smith, A. F. M. (1993). Novel approach to nonlinear/non-Gaussian Bayesian state estimation. IEE Proceedings F (Radar and Signal Processing), 140(2), 107–113. 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 |
| Alias≠ | SMC, sequential Monte Carlo, bootstrap filter, condensation algorithm | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| Berkaitan≠ | 4 | 3 |
| Ringkasan≠ | The particle filter, introduced by Gordon, Salmond, and Smith in 1993, is a sequential Monte Carlo algorithm that approximates the Bayesian filtering distribution for nonlinear and non-Gaussian state-space models. Rather than tracking a single best estimate, it maintains a cloud of N weighted random samples — particles — that collectively represent the full posterior distribution of a hidden state at each point in time as new observations arrive. | 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. |
| ScholarGateSet data ↗ |
|
|