Kernel stick-breaking processes
We propose a class of kernel stick-breaking processes for uncountable collections of dependent random probability measures. The process is constructed by first introducing an infinite sequence of random locations. Independent random probability measures and beta-distributed random weights are assigned to each location. Predictor-dependent random probability measures are then constructed by mixing over the locations, with stick-breaking probabilities expressed as a kernel multiplied by the beta weights. Some theoretical properties of the process are described, including a covariate-dependent prediction rule. A retrospective Markov chain Monte Carlo algorithm is developed for posterior computation, and the methods are illustrated using a simulated example and an epidemiological application. Copyright 2008, Oxford University Press.
Volume (Year): 95 (2008)
Issue (Month): 2 ()
|Contact details of provider:|| Postal: |
Fax: 01865 267 985
Web page: http://biomet.oxfordjournals.org/
|Order Information:||Web: http://www.oup.co.uk/journals|
When requesting a correction, please mention this item's handle: RePEc:oup:biomet:v:95:y:2008:i:2:p:307-323. 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.