Chapter 2 – The Pitfalls and Potential of Spatial Data

Chapter Objectives

  • Justify why spatial (geographic) data are fundamentally different from non-spatial data.
  • Enumerate four major analytical problems ("bad news") linked to spatial data:
    • Spatial autocorrelation
    • The modifiable areal unit problem (MAUP)
    • The ecological fallacy
    • Scale / non-uniform space & edge effects
  • Introduce four key spatial relations ("good news"): distance, adjacency, interaction, neighborhood.
  • Demonstrate construction & use of proximity polygons (Thiessen / Voronoi) and their dual, the Delaunay triangulation.
  • Show how these relations are efficiently stored & manipulated with matrices; encourage fluency with matrix notation.
  • Post-reading competencies:
    • List pitfalls
    • Describe distance/adjacency/interaction/neighborhood; create matrix versions
    • Produce proximity polygons & Delaunay triangulation for a point set

Introduction – Why Spatial Data Are "Special"

  • GIS diffusion → more data now carry explicit coordinates → statistical issues emerge.
  • Literature debates importance of "space" (e.g.",take the G out of GIS" discussions).
  • Spatial attributes change data behaviour → classic statistical tools often break.
  • Structure of chapter:
    • §2.2 Bad News (pitfalls)
    • §2.3 Good News (analytic opportunities)
  • Early exposure to formal definitions helps cultivate "spatial thinking".

BAD NEWS – Principal Pitfalls in Spatial Analysis

Spatial Autocorrelation (SAC)

  • Core violation: Many statistical tests need independent random samples; SAC implies dependence.
  • Definition: Nearby locations tend to carry similar attribute values.
  • Everyday illustration:
    • Elevation at X=250mX = 250\,m ⇒ Y (10 m away) likely 240260m240–260\,m; Z (1 km) less certain; Z (100 km) almost unconstrained.
    • Mountains/valleys, urban hotspots, storm cells – all reflect SAC.
  • Consequences:
    • Sample estimates biased toward over-sampled regions.
    • Effective sample size < nn (redundancy) → distorted confidence intervals, hypothesis tests.
    • Necessitates diagnostics (Moran’s II, Geary’s CC, variogram cloud) before conventional statistics.
  • Types of SAC
    • Positive (common) – similarity diminishes with distance.
    • Negative (rare) – local dissimilarity (e.g.",checkerboard patterns).
    • Zero – spatial randomness.
  • Spatial Variation
    • First-order: driven by underlying environmental gradient (e.g.", density gradients).
    • Second-order: interaction among observations (e.g.",crime induces neighboring crime).
    • Often intertwined; modeling usually tackles both.
  • Progress: While unsolved, geographers convert SAC into descriptive power via indices & spatial models.

Modifiable Areal Unit Problem (MAUP)

  • Arises when point/household data are aggregated into arbitrary zones (census tracts, counties, etc.).
  • Patterns & statistics depend on how you draw the boundaries.
  • Figure 2.1 illustration: two zoning schemes over same raw data → regression slopes & R2R^2 differ markedly.
  • Classic simulation (Openshaw & Taylor 1979): Same data can yield correlations anywhere from 1-1 to +1+1 under different aggregations!
  • Two intertwined effects:
    Aggregation (scale) effect – larger zones → values converge to global mean → stronger correlations.
    Zoning effect – different boundary layouts at same scale alter results.
  • Real-world impact: Gerrymandering, 2000 U.S. election, policy targeting with GIS.
  • Openshaw’s advice: Treat MAUP as an exploratory tool – search for zone systems that maximize/minimize relationships, then interrogate why.

Ecological Fallacy

  • Logical error: Inferring individual-level behavior from aggregate-level relationships.
  • Example: County-level link between low income & high crime ≠ proof poor persons commit more crime.
    • Could stem from surveillance, security quality, drug markets, etc.
  • Classic case: Doll (1955) scatterplot of national smoking vs lung cancer mortality shows strong correlation, but individual causation confirmed only via many micro-level studies.
  • Media & academic discourse still rife with fallacious leaps (death-penalty vs crime rates, helmet laws vs fatalities, etc.).
  • Ties to MAUP: relationship strength/type can flip across scales.

Scale & Representation

  • Object type selected (point/area/network) depends on map scale.
    • Continent: city = point.
    • Region: city = polygon.
    • Local: city = mix of objects.
  • Analytical outcomes vary with scale; "correct" scale rarely obvious → must experiment & justify.

Non-Uniform Space & Edge Effects

  • Spatial context varies (parks, water, roads, soil types, population density).
    • Pin maps of crimes show clusters/gaps that may simply reflect where people live/work.
  • Edge effect: Central sites have neighbors in all directions; boundary sites don’t. Artificial windows bias distance‐based analyses unless corrected (specialized corrections exist for some point-pattern methods).

GOOD NEWS – Spatial Relations as Analytical Powerhouses

Distance

  • Most common: Euclidean (crow-flight) distance for planar regions:
    d<em>ij=(x</em>ix<em>j)2+(y</em>iyj)2d<em>{ij}=\sqrt{(x</em>i-x<em>j)^2+(y</em>i-y_j)^2}
  • For large extents must consider Earth curvature; in some contexts use network distance, travel time, cost, or perceived distance.
  • Distance may violate symmetry (A→B ≠ B→A) under winds, traffic, cognition.
  • Gatrell (1983) surveys distance types; exercises in text: London Euston–Waterloo trip via straight-line, taxi (cost), Underground (time).

Adjacency (Binary Near-ness)

  • Entities either share a relation (=1) or not (=0).
    • Polygons sharing an edge.
    • "Within 100m100\,m" criterion.
    • "k nearest neighbors" (may yield asymmetric adjacency).
  • Example: Air connections – London adjacent to Belfast & Dublin by flights; Belfast not adjacent to Dublin.
  • Vital for spatial autocorrelation statistics, spatial interpolation, and many lattice-based models.

Interaction (Weighted Near-ness)

  • Captures the strength of relation; typically inverse-distance-weighted:
    w<em>ij    1d</em>ijkw<em>{ij}\;\propto\;\dfrac{1}{d</em>{ij}^k}
  • Can include attribute magnitudes:
    w<em>ij    p</em>ip<em>jd</em>ijkw<em>{ij}\;\propto\;\dfrac{p</em>i p<em>j}{d</em>{ij}^k}
  • Can replace distance with trade volumes, commuting flows, etc.
  • Foundation of many interpolation & spatial‐regression schemes.

Neighborhood

  • Several definitions:
    • Set of all adjacent entities.
    • Region within fixed distance.
    • Emergent homogeneous patch (e.g., mountain = high‐elevation neighborhood).
  • Illustrated in Fig. 2.2: polygon around A including A, E, F (adjacency) vs Voronoi cell (distance-defined region).

Matrix Representation of Spatial Relationships

  • Matrix = table of numbers (rows & columns labelled by spatial entities).
  • Distance matrix D{\bf D} for objects A–F (Eq 2.5) – symmetric, zero diagonal.
  • Adjacency matrices A<em>d<50{\bf A}<em>{d<50} vs A</em>k=3{\bf A}</em>{k=3} show how rules alter symmetry & row/column sums.
  • Interaction/weights matrix W{\bf W}:
    • Raw inverse distances include \infty on diagonal → often set to 0 or ignored.
    • Standardized version divides each row by its sum → rows sum to 1, columns indicate global influence (A most influential in example).
  • Matrices enable compact algebra, eigen-analysis, regression extensions, and efficient computation.

Proximity Polygons & Delaunay Triangulation

  • Proximity polygon (Voronoi/Thiessen): Region closer to a given entity than to any other.
  • Construction for points: draw perpendicular bisectors of all point pairs; intersections ⇢ polygon edges (Fig 2.4).
  • Properties:
    • Partitions space with no overlaps or gaps.
    • Extendable to lines, areas, mixed objects, & even 3-D (becomes polyhedra/bubbles).
    • Easily adapts to network distances (Okabe et al. 2000, 2008).
  • Geographic utilities:
    • Service‐area approximation (closest post office, school catchment).
    • Basis for nearest neighbor graphs, spatial interpolation, cluster detection.
  • Delaunay triangulation: dual of Voronoi; connect centroids whose polygons share an edge (Fig 2.5).
    • Produces triangles favoring equilateral shape; valuable for terrain meshes (TINs) & point pattern analysis.
  • Advantage over fixed-distance adjacency: adjusts to local point density (non-uniform space).

Chapter Review (Key Take-aways)

  • Spatial data ≠ ordinary data: SAC, MAUP, ecological fallacy, scale & non-uniformity complicate classic stats.
  • Matrices let us encode distance, adjacency, interaction, neighborhood elegantly → cornerstone of modern GISci analysis.
  • Proximity polygons/Delaunay enrich neighborhood definitions & power many advanced spatial algorithms.
  • Despite historical criticisms, tools now exist to address (or creatively exploit) these issues → spatial analysis is both challenging and potent.

Numerical, Statistical & Formula References

  • Distance formula dijd_{ij} (Eq 2.1).
  • Interaction weights w<em>ij1/d</em>ijkw<em>{ij} \propto 1/d</em>{ij}^k and w<em>ijp</em>ip<em>j/d</em>ijkw<em>{ij} \propto p</em>i p<em>j/d</em>{ij}^k.
  • Matrix examples D,A,W{\bf D}, {\bf A}, {\bf W} (Eq 2.5–2.9).
  • Ability to vary exponent kk, choose row-standardization, etc.

Connections & Implications

  • Builds on basic descriptive stats (mean/variance) but introduces location as analytic axis.
  • Sets stage for later chapters:
    • Chapter 4 – spatial processes & 1st/2nd-order variation.
    • Chapter 7 – global/local autocorrelation metrics.
    • Chapters 9-10 – interpolation (IDW, Kriging) & variogram modelling.
  • Real-world areas: urban planning (crime hotspots), public health (disease clustering), environmental modelling (terrain, soils), political redistricting.
  • Ethical-political relevance: boundaries alter insights → transparency & sensitivity analyses essential.

Suggested Practice / Thought Exercises

  • Compute straight-line, taxi-meter & Underground travel "distances" between London Euston & Waterloo; discuss which is appropriate when.
  • Redraw a transport map where edge lengths reflect adjacency only (à la Beck’s Tube map); extend to perceived time or cost.
  • Generate Voronoi polygons for local amenities; test as service areas; compare with administrative catchments.
  • Experiment with MAUP: aggregate synthetic point data into multiple zoning schemes; plot slope & R2R^2 variation.
  • Review Appendix on matrices; code distance & weight matrices in GIS/NumPy/R to build intuition.