Fast Spatial Autocorrelation
Anar Amgalan, Lilianne R. Mujica-Parodi, Steven S. Skiena

TL;DR
This paper introduces a new spatial autocorrelation statistic, $S_A$, which can be computed in linear time and effectively detects spatial correlations in large datasets, outperforming traditional methods like Moran's I and Geary's C.
Contribution
The authors propose the $S_A$ statistic and a linear-time algorithm for its computation, enabling fast and scalable spatial autocorrelation analysis.
Findings
$S_A$ can be computed in 1 second for 63,000 points.
$S_A$ detects spatial correlations earlier than Moran's I and Geary's C.
$S_A$ has desirable theoretical properties, including being a true correlation and invariant under scaling.
Abstract
Physical or geographic location proves to be an important feature in many data science models, because many diverse natural and social phenomenon have a spatial component. Spatial autocorrelation measures the extent to which locally adjacent observations of the same phenomenon are correlated. Although statistics like Moran's and Geary's are widely used to measure spatial autocorrelation, they are slow: all popular methods run in time, rendering them unusable for large data sets, or long time-courses with moderate numbers of points. We propose a new statistic based on the notion that the variance observed when merging pairs of nearby clusters should increase slowly for spatially autocorrelated variables. We give a linear-time algorithm to calculate for a variable with an input agglomeration order (available at…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpatial and Panel Data Analysis · Land Use and Ecosystem Services · Economic and Environmental Valuation
