A Neural Network-based Method for Solving “Nested Hierarchy” Areal Interpolation Problems

Authors: Merwin, David; Cromley, Robert; Civco, Daniel

Source: Cartography and Geographic Information Science, Volume 36, Number 4, October 2009 , pp. 347-365(19)

Publisher: Cartography and Geographic Information Society

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Abstract:

This study proposes a neural network approach to solving areal interpolation scenarios, specifically the “nested hierarchy” problem. The neural network method presented adopts the approach taken by intelligent interpolation methods where ancillary spatial information is presented to assist in achieving more accurate results. For this study, the data to be estimated are total populations for census tracts and block groups in Hartford County, Connecticut. A number of neural network models are generated containing various combinations of ancillary spatial information. The neural-network-derived predictions are compared with the predicted populations derived from three existing interpolation methods: areal weighting, a dasymetric areal weighting approach using remote sensing data, and ordinary least squares (OLS) regression. For each scenario presented, the proposed neural network approach outperforms each of the existing methods.

Document Type: Research article

DOI: 10.1559/152304009789786335

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$23.00 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A