Analytics and Modeling

This knowledge area embodies a variety of data driven analytics, geocomputational methods, simulation and model driven approaches designed to study complex spatial-temporal problems, develop insights into characteristics of geospatial data sets, create and test geospatial process models, and construct knowledge of the behavior of geographically-explicit and dynamic processes and their patterns.

Topics in this Knowledge Area are listed thematically below. Existing topics are in regular font and linked directly to their original entries (published in 2006; these contain only Learning Objectives). Entries that have been updated and expanded are in bold. Forthcoming, future topics are italicized. 

 

Conceptual Frameworks for Spatial Analysis & Modeling Data Exploration & Spatial Statistics Network & Location Analysis
Basic Primitives Spatial Sampling for Spatial Analysis Intro to Network & Location Analysis
Spatial Relationships Exploratory Spatial Data Analysis (ESDA) Network Route & Tour Problems
Neighborhoods Kernels & Density Estimation Location & Service Area Problems
First & Second Laws of Geography Spatial Interaction Modelling Accessibility
Spatial Statistics Cartographic Modeling Location-allocation Modeling
Methodological Context Multi-criteria Evaluation The Classic Transportation Problem
Spatial Analysis as a Process Spatial Process Models Space-Time Analysis & Modeling
Geospatial Analysis & Model Building Grid-based Statistics and Metrics Time Geography
Changing Context of GIScience Landscape Metrics Capturing Spatio-Temporal Dynamics in Computational Modeling 
Data Manipulation DEM and Terrain Metrics GIS-Based Computational Modeling
Point, Line, and Area Generalization Point Pattern Analysis Computational Movement Analysis
Coordinate transformations Hot-spot and Cluster Analysis Accounting for Errors in Space-Time Modeling
Data conversion Global Measures of Spatial Association Geocomputational Methods & Models
Impacts of transformations Local Measures of Spatial Association Cellular Automata
Raster resampling Simple Regression & Trend Surface Analysis Agent-based Modeling
Vector-to-raster and raster-to-vector conversions Geographically Weighted Regression Simulation Modeling
Generalization & Aggregation Spatial Autoregressive & Bayesian Methods Simulation & Modeling Systems for Agent-based Modeling
Transaction Management Spatial Filtering Models Artificial Neural Networks
Building Blocks   Genetic Algorithms & Evolutionary Computing 
Spatial & Spatiotemporal Data Models Surface & Field Analysis Big Data & Geospatial Analysis
Length & Area Operations Modeling Surfaces Problems & Issues with Large Spatial Databases
Polyline & Polygon Operations Surface Geometry Pattern Recognition & Matching
Overlay & Combination Operations Intervisibility Artificial Intelligence Approaches
Areal Interpolation Watersheds & Drainage Data Mining Approaches
Classification & Clustering Gridding, Interpolation, and Contouring Rule Learning for Spatial Data Mining
Boundaries & Zone Membership Deterministic Interpolation Models Machine Learning Approaches
Tesselations & Triangulations Inverse Distance Weighting CyberGIS
Spatial Queries Radial Basis & Spline Functions Analysis of Errors & Uncertainty
Distance Operations Triangulation Problems of Currency, Source, and Scale
Buffers Polynomial Functions Problems of Scale & Zoning
Directional Operations Core Concepts in Geostatistics Theory of Error Propagation
Grid Operations & Map Algebra Kriging Interpolation Propagation of Error in Geospatial Modeling
    Fuzzy Aggregation Operators
    Mathematical Models of Uncertainty

 

AM-16 - Interpolation methods
  • Identify the spatial concepts that are assumed in different interpolation algorithms
  • Compare and contrast interpolation by inverse distance weighting, bi-cubic spline fitting, and kriging
  • Differentiate between trend surface analysis and deterministic spatial interpolation
  • Explain why different interpolation algorithms produce different results and suggest ways by which these can be evaluated in the context of a specific problem
  • Design an algorithm that interpolates irregular point elevation data onto a regular grid
  • Outline algorithms to produce repeatable contour-type lines from point datasets using proximity polygons, spatial averages, or inverse distance weighting
  • Implement a trend surface analysis using either the supplied function in a GIS or a regression function from any standard statistical package
  • Describe how surfaces can be interpolated using splines
  • Explain how the elevation values in a digital elevation model (DEM) are derived by interpolation from irregular arrays of spot elevations
  • Discuss the pitfalls of using secondary data that has been generated using interpolations (e.g., Level 1 USGS DEMs)
  • Estimate a value between two known values using linear interpolation (e.g., spot elevations, population between census years)
AM-17 - Intervisibility
  • Define “intervisibility”
  • Outline an algorithm to determine the viewshed (area visible) from specific locations on surfaces specified by DEMs
  • Perform siting analyses using specified visibility, slope, and other surface related constraints
  • Explain the sources and impact of errors that affect intervisibility analyses
AM-08 - Kernels and density estimation
  • Describe the relationships between kernels and classical spatial interaction approaches, such as surfaces of potential
  • Outline the likely effects on analysis results of variations in the kernel function used and the bandwidth adopted
  • Explain why and how density estimation transforms point data into a field representation
  • Explain why, in some cases, an adaptive bandwidth might be employed
  • Create density maps from point datasets using kernels and density estimation techniques using standard software
  • Differentiate between kernel density estimation and spatial interpolation
AM-37 - Knowledge discovery
  • Explain how spatial data mining techniques can be used for knowledge discovery
  • Explain how a Bayesian framework can incorporate expert knowledge in order to retrieve all relevant datasets given an initial user query
  • Explain how visual data exploration can be combined with data mining techniques as a means of discovering research hypotheses in large spatial datasets
AM-29 - Kriging methods
  • Describe the relationship between the semi-variogram and kriging
  • Explain why it is important to have a good model of the semi-variogram in kriging
  • Explain the concept of the kriging variance, and describe some of its shortcomings
  • Explain how block-kriging and its variants can be used to combine data sets with different spatial resolution (support)
  • Compare and contrast block-kriging with areal interpolation using proportional area weighting and dasymetric mapping
  • Outline the basic kriging equations in their matrix formulation
  • Conduct a spatial interpolation process using kriging from data description to final error map
  • Explain why kriging is more suitable as an interpolation method in some applications than others
AM-40 - Least-cost (shortest) path analysis
  • Describe some variants of Dijkstra’s algorithm that are even more efficient
  • Discuss the difference of implementing Dijkstra’s algorithm in raster and vector modes
  • Demonstrate how K-shortest path algorithms can be implemented to find many efficient alternate paths across the network
  • Compute the optimum path between two points through a network with Dijkstra’s algorithm
  • Explain how a leading World Wide Web-based routing system works (e.g., MapQuest, Yahoo Maps, Google)
AM-23 - Local measures of spatial association
  • Describe the effect of non-stationarity on local indices of spatial association
  • Decompose Moran’s I and Geary’s c into local measures of spatial association
  • Compute the Gi and Gi* statistics
  • Explain how geographically weighted regression provides a local measure of spatial association
  • Explain how a weights matrix can be used to convert any classical statistic into a local measure of spatial association
  • Compare and contrast global and local statistics and their uses
AM-46 - Location-allocation modeling

Location-allocation models involve two principal elements: 1) multiple facility location; and 2) the allocation of the services or products provided by those facilities to places of demand. Such models are used in the design of logistic systems like supply chains, especially warehouse and factory location, as well as in the location of public services. Public service location models involve objectives that often maximize access and levels of service, while private sector applications usually attempt to minimize cost. Such models are often hard to solve and involve the use of integer-linear programming software or sophisticated heuristics. Some models can be solved with functionality provided in GIS packages and other models are applied, loosely coupled, with GIS. We provide a short description of formulating two different models as well as discuss how they are solved.

AM-06 - Map algebra
  • Explain the categories of map algebra operations (i.e., local, focal, zonal, and global functions)
  • Explain why georegistration is a precondition to map algebra
  • Differentiate between map algebra and matrix algebra using real examples
  • Perform a map algebra calculation using command line, form-based, and flow charting user interfaces
  • Describe a real modeling situation in which map algebra would be used (e.g., site selection, climate classification, least-cost path)
  • Describe how map algebra performs mathematical functions on raster grids
AM-48 - Mathematical models of uncertainty: probability and statistics
  • Devise simple ways to represent probability information in GIS
  • Describe the basic principles of randomness and probability
  • Compute descriptive statistics and geostatistics of geographic data
  • Interpret descriptive statistics and geostatistics of geographic data
  • Recognize the assumptions underlying probability and geostatistics and the situations in which they are useful analytical tools

Pages