ロード中...
A general construction for parallelizing Metropolis−Hastings algorithms
Markov chain Monte Carlo methods (MCMC) are essential tools for solving many modern-day statistical and computational problems; however, a major limitation is the inherently sequential nature of these algorithms. In this paper, we propose a natural generalization of the Metropolis−Hastings algorithm...
保存先:
| 出版年: | Proc Natl Acad Sci U S A |
|---|---|
| 第一著者: | |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
National Academy of Sciences
2014
|
| 主題: | |
| オンライン･アクセス: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4267367/ https://ncbi.nlm.nih.gov/pubmed/25422442 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.1408184111 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|