z-logo
Premium
A Bayesian kriged Kalman model for short‐term forecasting of air pollution levels
Author(s) -
Sahu Sujit K.,
Mardia Kanti V.
Publication year - 2005
Publication title -
journal of the royal statistical society: series c (applied statistics)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.205
H-Index - 72
eISSN - 1467-9876
pISSN - 0035-9254
DOI - 10.1111/j.1467-9876.2005.00480.x
Subject(s) - kalman filter , markov chain monte carlo , bayesian probability , kriging , term (time) , computer science , environmental science , mahalanobis distance , bayesian inference , econometrics , meteorology , statistics , data mining , machine learning , mathematics , artificial intelligence , geography , physics , quantum mechanics
Summary.  Short‐term forecasts of air pollution levels in big cities are now reported in news‐papers and other media outlets. Studies indicate that even short‐term exposure to high levels of an air pollutant called atmospheric particulate matter can lead to long‐term health effects. Data are typically observed at fixed monitoring stations throughout a study region of interest at different time points. Statistical spatiotemporal models are appropriate for modelling these data. We consider short‐term forecasting of these spatiotemporal processes by using a Bayesian kriged Kalman filtering model. The spatial prediction surface of the model is built by using the well‐known method of kriging for optimum spatial prediction and the temporal effects are analysed by using the models underlying the Kalman filtering method. The full Bayesian model is implemented by using Markov chain Monte Carlo techniques which enable us to obtain the optimal Bayesian forecasts in time and space. A new cross‐validation method based on the Mahalanobis distance between the forecasts and observed data is also developed to assess the forecasting performance of the model implemented.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here