z-logo
Premium
Regionalization of multiscale spatial processes by using a criterion for spatial aggregation error
Author(s) -
Bradley Jonathan R.,
Wikle Christopher K.,
Holan Scott H.
Publication year - 2017
Publication title -
journal of the royal statistical society: series b (statistical methodology)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 6.523
H-Index - 137
eISSN - 1467-9868
pISSN - 1369-7412
DOI - 10.1111/rssb.12179
Subject(s) - spatial analysis , computer science , representation (politics) , variance (accounting) , spatial ecology , mathematics , statistical physics , statistics , ecology , physics , accounting , politics , political science , law , business , biology
Summary   The modifiable areal unit problem and the ecological fallacy are known problems that occur when modelling multiscale spatial processes. We investigate how these forms of spatial aggregation error can guide a regionalization over a spatial domain of interest. By ‘regionalization’ we mean a specification of geographies that define the spatial support for areal data. This topic has been studied vigorously by geographers but has been given less attention by spatial statisticians. Thus, we propose a criterion for spatial aggregation error, which we minimize to obtain an optimal regionalization. To define the criterion we draw a connection between spatial aggregation error and a new multiscale representation of the Karhunen–Loève expansion. This relationship between the criterion for spatial aggregation error and the multiscale Karhunen–Loève expansion leads to illuminating theoretical developments including connections between spatial aggregation error, squared prediction error, spatial variance and a novel extension of Obled–Creutin eigenfunctions. The effectiveness of our approach is demonstrated through an analysis of two data sets: one using the American Community Survey and one related to environmental ocean winds.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here