University of Cambridge > Talks.cam > Machine Learning @ CUED > Sparse Gaussian Process in Disease Mapping

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Sparse Gaussian Process in Disease Mapping

Download to your calendar using vCal

If you have a question about this talk, please contact Zoubin Ghahramani .

Disease mapping is a research area in spatial epidemiology, which aims to describe the overall disease distribution on a map. The aim might be, for example, to highlight areas of elevated or lowered mortality or morbidity risk. Gaussian process gives a natural prior for the log risk surface, since the spatial correlations between areas can be included in an explicit and natural way into the model via a correlation function. The drawback with using a Gaussian process is the computational burden of the covariance matrix calculations and analytically intractable model. In this talk we consider sparse approximations to Gaussian process prior to speed up the computations and approximate approaches for posterior inference. The sparse approximations are fully and partially independent conditional (FIC and PIC ) and the posterior inference is conducted with a help of Markov chain Monte Carlo methods and expectation propagation.

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Webinar & FW11, Computer Laboratory, William Gates Building. Average on weekdays: 8726.83333333 kWh Potter Room / https://cam-ac-uk.zoom.us/j/87235967698

Other talks

Group Work Strange New Worlds Title TBC Diasporic Divas: Performing Race, Gender, and Sexuality from the 18th Century to Today Topic Film, TV shows for Medical Education, ‘The Wire’ as a case study Online Causal Inference Seminar
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity