Sparse Approximate Inference for Spatio-Temporal Point Process Models
- 1 October 2016
- journal article
- theory and-methods
- Published by Taylor & Francis in Journal of the American Statistical Association
- Vol. 111 (516) , 1746-1763
Abstract
Spatio-temporal log-Gaussian Cox process models play a central role in the analysis of spatially distributed systems in several disciplines. Yet, scalable inference remains computationally challenging both due to the high-resolution modeling generally required and the analytically intractable likelihood function. Here, we exploit the sparsity structure typical of (spatially) discretized log-Gaussian Cox process models by using approximate message-passing algorithms. The proposed algorithms scale well with the state dimension and the length of the temporal horizon with moderate loss in distributional accuracy. They hence provide a flexible and faster alternative to both nonlinear filtering-smoothing type algorithms and to approaches that implement the Laplace method or expectation propagation on (block) sparse latent Gaussian models. We infer the parameters of the latent Gaussian model using a structured variational Bayes approach. We demonstrate the proposed framework on simulation studies with both Gaussian and point-process observations and use it to reconstruct the conflict intensity and dynamics in Afghanistan from the WikiLeaks Afghan War Diary. Supplementary materials for this article are available online.Keywords
All Related Versions
This publication has 32 references indexed in Scilit:
- A space-time point process model for analyzing and predicting case patterns of diarrheal disease in northwestern EcuadorSpatial and Spatio-temporal Epidemiology, 2014
- Geographic patterns of diffusion in the 2011 London riotsApplied Geography, 2013
- Covariance selection for nonchordal graphs via chordal embeddingOptimization Methods and Software, 2008
- Direct Methods for Sparse Linear Systems2006
- Point process methodology for on‐line spatio‐temporal disease surveillanceEnvironmetrics, 2005
- Nested-Dissection Orderings for Sparse LU with Partial PivotingSIAM Journal on Matrix Analysis and Applications, 2002
- Dispersive properties of the natural element methodComputational Mechanics, 2000
- An Approximate Minimum Degree Ordering AlgorithmSIAM Journal on Matrix Analysis and Applications, 1996
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973
- Reducing the bandwidth of sparse symmetric matrices1969