ScholarGate
Trợ lý

So sánh phương pháp

Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.

Lấy mẫu Gibbs để so sánh mô hình×Lấy mẫu Gibbs×
Lĩnh vựcBayesBayes
HọBayesian methodsBayesian methods
Năm ra đời19951984
Người khởi xướngCarlin and ChibStuart Geman & Donald Geman
LoạiBayesian model selection via MCMCMCMC sampling algorithm
Công trình gốcCarlin, B. P. & Chib, S. (1995). Bayesian model choice via Markov chain Monte Carlo methods. Journal of the Royal Statistical Society, Series B, 57(3), 473-484. 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 ↗
Tên gọi khácGibbs-based model selection, MCMC model comparison via Gibbs, Bayesian model comparison with Gibbs sampling, Gibbs sampler model selectionGibbs sampler, coordinate-wise MCMC, systematic scan Gibbs, blocked Gibbs sampling
Liên quan35
Tóm tắtGibbs sampling for model comparison is a Bayesian MCMC approach that simultaneously samples from the space of competing models and their parameters. By augmenting the Gibbs sampler with a discrete model-index variable, posterior model probabilities and Bayes factors are estimated from the resulting Markov chain without requiring separate runs per model.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.
ScholarGateBộ dữ liệu
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED

Đến trang tìm kiếm Tải xuống bản trình chiếu

ScholarGateSo sánh phương pháp: Gibbs Sampling for Model Comparison · Gibbs Sampling. Truy cập ngày 2026-06-17 từ https://scholargate.app/vi/compare