Académique Documents
Professionnel Documents
Culture Documents
Outline
Concepts
Contiguity Weights
Distance-Based Weights
Characteristics of Weights
Spatially Lagged Variables
Copyright 2004-2006 by Luc Anselin, All Rights Reserved
Concepts
Spatial Autocorrelation
Match
value similarity
locational similarity
Solution
Impose Structure on the Problem
set some interactions to zero
only neighbors interact directly
constrain the number of neighbors
5
4
6 Polygon Layout
Neighbor as Having Common Boundary
Copyright 2004-2006 by Luc Anselin, All Rights Reserved
Links
Nodes
w
w
ij
Binary Contiguity
Weights are 0 or 1
for i, j neighbors, w = 1
Example, using common boundary
ij
Socio-Economic Weights
Copyright 2004-2006 by Luc Anselin, All Rights Reserved
Contiguity Weights
Contiguity
Common Boundary
Rook Contiguity
1
Neighbors for 5: 2, 4, 6, 8
Common Border
Copyright 2004-2006 by Luc Anselin, All Rights Reserved
Rook Weights
Bishop Contiguity
1
Neighbors for 5: 1, 3, 7, 9
Common Vertex
Copyright 2004-2006 by Luc Anselin, All Rights Reserved
Bishop Weights
Queen Contiguity
1
8 Neighbors for 5
Both Border and Vertex
Copyright 2004-2006 by Luc Anselin, All Rights Reserved
Queen Weights
Thiessen Polygons
Contiguity Weights
Contiguity Gotchas
Derived from GIS
Contiguity
checking boundary file for common arcs
and/or points
Grid Polygons
Regular
lack of precision can cause misalignment
artificial neighbors
Centerline
Street
different conventions can cause islands
Copyright 2004-2006 by Luc Anselin, All Rights Reserved
misaligned
properly aligned
Copyright 2004-2006 by Luc Anselin, All Rights Reserved
Distance-Based Weights
Distance Metrics
For Projected Points
planar coordinates
Euclidean Distance
as
Minkowski Metric
dij = ( | xi - xj |p + | yi - yj |p )(1/p)
Arc Distance
d = R. arccos[sin(y ).sin(y )
+cos(x ).cos(x ).cos(x -x )]
R = radius of earth 6378 km or 3963 mi
ij
Distance-Based Weights
Distance Cut-Off
critical distance
w = 1 for d < , w = 0 otherwise
avoid islands max (min d )
ij
ij
ij
K-Nearest Neighbors
ij
Threshold
F
Text
D
Nearest Neighbor
A
Distance Matrix
Distance Weights
symmetric
Distance Matrix
Distance Weights
symmetric
K-Nearest Neighbors
Distance Weights
k=3
asymmetric
Characteristics of
Weights
Connectivity
Measures of Overall Connectedness
% non-zero weights: sparseness
distribution/average number of links
average weight
Location-Specific Measures
Spatial Weights
Characteristics in R
Connectivity Histogram
Island Connectivity
Spatially Lagged
Variables
Spatial Lag
Weighted Average of Neighbors
y = w .y + w .y + ... + w .y
y = w y , y = Wy
most w are zero, only non-zero count
iL
i1 1
iL
ij j
i2 2
iN N
ij