Papers › Spatial regionalization based on optimal information compression
Spatial regionalization based on optimal information compression
Alec Kirkley
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Regionalization, spatially contiguous clustering, provides a means to reduce the effect of noise in sampled data and identify homogeneous areas for policy development among many other applications. Existing regionalization methods require user input such as the number of regions or a similarity measure between regions, which does not allow for the extraction of the natural regions defined solely by the data itself. Here we view the problem of regionalization as one of data compression and develop an efficient, parameter-free regionalization algorithm based on the minimum description length principle. We demonstrate that our method is capable of recovering planted spatial clusters in noisy synthetic data, and that it can meaningfully coarse-grain real demographic data. Using our description length formulation, we find that spatial ethnoracial data in U.S. metropolitan areas has become less compressible over the period from 1980 to 2010, reflecting the rising complexity of urban segregation patterns in these metros.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections