Fast Selection of Spatially Balanced Samples
Roberto Benedetti, Federica Piersimoni

TL;DR
This paper introduces a fast, draw-by-draw spatially balanced sampling algorithm that reduces computational complexity while maintaining efficiency, demonstrated through simulations and real-world land cover data.
Contribution
It proposes a novel, computationally efficient sampling method that updates selection probabilities based on spatial distances, improving over existing algorithms in large populations.
Findings
The new method achieves comparable RMSE to existing methods.
It significantly reduces computational time compared to traditional algorithms.
Application to LUCAS data illustrates practical effectiveness.
Abstract
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, , 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 . In this paper we propose a draw-by-draw algorithm that randomly selects a sample of size in exactly 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…
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 · Soil Geostatistics and Mapping · Economic and Environmental Valuation
