Enhancing geographical information systems capabilities with multi-criteria evaluation functions

ou

Representing Space: A Hybrid Genetic Algorithm for Aesthetic Graph Layout

This paper describes a hybrid Genetic Algorithm (GA) that is used to improve the layout of a graph according to a number of aesthetic criteria. The GA incorporates spatial and topological information by operating directly with a graph based representation. Initial results show this to be a promising technique for positioning graph nodes on a surface and may form the basis of a more general approach for problems involving multi-criteria spatial optimisation

Inverse meta-modelling to estimate soil available water capacity at high spatial resolution across a farm

Geo-referenced information on crop production that is both spatially- and temporally-dense would be useful for management in precision agriculture (PA). Crop yield monitors provide spatially but not temporally dense information. Crop growth simulation modelling can provide temporal density, but traditionally fail on the spatial issue. The research described was motivated by the challenge of satisfying both the spatial and temporal data needs of PA. The methods presented depart from current crop modelling within PA by introducing meta-modelling in combination with inverse modelling to estimate site-specific soil properties. The soil properties are used to predict spatially- and temporally-dense crop yields. An inverse meta-model was derived from the agricultural production simulator (APSIM) using neural networks to estimate soil available water capacity (AWC) from available yield data. Maps of AWC with a resolution of 10 m were produced across a dryland grain farm in Australia. For certain years and fields, the estimates were useful for yield prediction with APSIM and multiple regression, whereas for others the results were disappointing. The estimates contain ‘implicit information’ about climate interactions with soil, crop and landscape that needs to be identified. Improvement of the meta-model with more AWC scenarios, more years of yield data, inclusion of additional variables and accounting for uncertainty are discussed. We concluded that it is worthwhile to pursue this approach as an efficient way of extracting soil physical information that exists within crop yield maps to create spatially- and temporally-dense dataset

High-Dimensional Bayesian Geostatistics

With the growing capabilities of Geographic Information Systems (GIS) and user-friendly software, statisticians today routinely encounter geographically referenced data containing observations from a large number of spatial locations and time points. Over the last decade, hierarchical spatiotemporal process models have become widely deployed statistical tools for researchers to better understand the complex nature of spatial and temporal variability. However, fitting hierarchical spatiotemporal models often involves expensive matrix computations with complexity increasing in cubic order for the number of spatial locations and temporal points. This renders such models unfeasible for large data sets. This article offers a focused review of two methods for constructing well-defined highly scalable spatiotemporal stochastic processes. Both these processes can be used as "priors" for spatiotemporal random fields. The first approach constructs a low-rank process operating on a lower-dimensional subspace. The second approach constructs a Nearest-Neighbor Gaussian Process (NNGP) that ensures sparse precision matrices for its finite realizations. Both processes can be exploited as a scalable prior embedded within a rich hierarchical modeling framework to deliver full Bayesian inference. These approaches can be described as model-based solutions for big spatiotemporal datasets. The models ensure that the algorithmic complexity has $\sim n$ floating point operations (flops), where $n$ the number of spatial locations (per iteration). We compare these methods and provide some insight into their methodological underpinnings

Building a Static Farm Level Spatial Microsimulation Model: Statistically Matching the Irish National Farm Survey to the Irish Census of Agriculture

This paper looks at the statistical matching technique used to match the Irish Census of Agriculture to the Irish National Farm Survey (NFS) to produce a farm level static spatial microsimulation model of Irish agriculture. The match produces a spatially disaggregated population microdata set of farm households for all of Ireland. Using statistical matching techniques, economists can now create more attribute rich datasets by matching across the common variables in two or more datasets. Static spatial microsimulation then uses these synthetic datasets to analyse the relationships among regions and localities and to project the spatial implications of economic development and policy changes in rural areas. The Irish agriculture microsimulation model uses one of many combinational optimatisation techniques - simulated annealing - to match the Census of Agriculture and the NFS. The static model uses this matched NFS and Census information to produce small area (District Electric Divisions (DED)) population microdata estimates for a particular year. Using the matched NFS/Census microdata, this paper will then analysis the regional farm income distribution for Ireland.

Hierarchical Nearest-Neighbor Gaussian Process Models for Large Geostatistical Datasets

Spatial process models for analyzing geostatistical data entail computations that become prohibitive as the number of spatial locations become large. This manuscript develops a class of highly scalable Nearest Neighbor Gaussian Process (NNGP) models to provide fully model-based inference for large geostatistical datasets. We establish that the NNGP is a well-defined spatial process providing legitimate finite-dimensional Gaussian densities with sparse precision matrices. We embed the NNGP as a sparsity-inducing prior within a rich hierarchical modeling framework and outline how computationally efficient Markov chain Monte Carlo (MCMC) algorithms can be executed without storing or decomposing large matrices. The floating point operations (flops) per iteration of this algorithm is linear in the number of spatial locations, thereby rendering substantial scalability. We illustrate the computational and inferential benefits of the NNGP over competing methods using simulation studies and also analyze forest biomass from a massive United States Forest Inventory dataset at a scale that precludes alternative dimension-reducing methods