Adaptive approximate Bayesian computation
Sequential techniques can enhance the efficiency of the approximate Bayesian computation algorithm, as in Sisson et al.'s (2007) partial rejection control version. While this method is based upon the theoretical works of Del Moral et al. (2006), the application to approximate Bayesian computation results in a bias in the approximation to the posterior. An alternative version based on genuine importance sampling arguments bypasses this difficulty, in connection with the population Monte Carlo method of Cappé et al. (2004), and it includes an automatic scaling of the forward kernel. When applied to a population genetics example, it compares favourably with two other versions of the approximate algorithm. Copyright 2009, Oxford University Press.
Volume (Year): 96 (2009)
Issue (Month): 4 ()
|Contact details of provider:|| Postal: Oxford University Press, Great Clarendon Street, Oxford OX2 6DP, UK|
Fax: 01865 267 985
Web page: https://academic.oup.com/biomet
|Order Information:||Web: http://www.oup.co.uk/journals|
When requesting a correction, please mention this item's handle: RePEc:oup:biomet:v:96:y:2009:i:4:p:983-990. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Oxford University Press)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.