Papers › Fast Selection of Spatially Balanced Samples
Fast Selection of Spatially Balanced Samples
Roberto Benedetti, Federica Piersimoni
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.
Sampling from very large spatial populations is challenging. The solutions suggested in recent literature on this subject often require that the randomly selected units are well distributed across the study region by using complex algorithms that have the feature, essential in a design-based framework, to respect the fixed first-order inclusion probabilities for every unit of the population. The size of the frame, N, often causes some problems to these algorithms since, being based on the distance matrix between the units of the population, have at least a computational cost of order N². In this paper we propose a draw-by-draw algorithm that randomly selects a sample of size n in exactly n steps, updating at each step the selection probability of not-selected units depending on their distance from the units already selected in the previous steps. The performance of this solution is compared with those of other methods derived from the {\it spatially balanced sampling} literature in terms of their root mean squared error (RMSE) using the simple random sampling (SRS) without replacement as benchmark. The fundamental interest is not only to evaluate the efficiency of a such different procedure, but also to understand if similar results can be obtained even with a notable reduction in the computational burden needed to obtain more efficient sampling designs. Repeated sample selections on real and simulated populations support this perspective. An application to the Land Use and Land Cover Survey (LUCAS) 2012 data-set in an Italian region is presented as a concrete and practical illustration of the capabilities of the proposed sample selection method.
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