방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Markov Chain Monte Carlo (MCMC)× | 몬테카를로 시뮬레이션× | |
|---|---|---|
| 분야≠ | 시뮬레이션 | 의사결정 |
| 계열≠ | Process / pipeline | MCDM |
| 기원 연도≠ | 1953 (Metropolis-Hastings); 1984 (Gibbs) | 1949 |
| 창시자≠ | Metropolis et al. (1953); Gibbs sampler formalised by Geman & Geman (1984) | Metropolis, N., Ulam, S. |
| 유형≠ | Simulation-based Bayesian inference / numerical integration | Robustness wrapper — Monte Carlo uncertainty propagation |
| 원전≠ | Gelman, A., Carlin, J.B., Stern, H.S., Dunson, D.B., Vehtari, A. & Rubin, D.B. (2013). Bayesian Data Analysis (3rd ed.). Chapman & Hall/CRC. DOI ↗ | Metropolis, N., Ulam, S. (1949). The Monte Carlo method. Journal of the American Statistical Association DOI ↗ |
| 별칭≠ | MCMC, Metropolis-Hastings, Gibbs sampling, Markov Zinciri Monte Carlo (MCMC — Metropolis-Hastings, Gibbs) | — |
| 관련≠ | 5 | 0 |
| 요약≠ | Markov Chain Monte Carlo (MCMC) is a family of simulation algorithms that constructs a Markov chain whose stationary distribution is the target posterior, enabling Bayesian inference and high-dimensional integral computation that would otherwise be analytically intractable. Pioneered by Metropolis and colleagues in 1953 and extended by Hastings in 1970, MCMC underpins modern Bayesian statistics. The two most widely used variants are Metropolis-Hastings, which proposes moves from a general proposal distribution, and Gibbs sampling, which draws each parameter in turn from its full conditional distribution. | MONTE-CARLO-SIMULATION (Monte Carlo Simulation — Stochastic uncertainty propagation through MCDM model) is a ranking multi-criteria decision-making (MCDM) method introduced by Metropolis, N., Ulam, S. in 1949. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result. |
| ScholarGate데이터셋 ↗ |
|
|