A fast algorithm for balanced sampling

DOI10.1007/S00180-006-0250-2MaRDI QIDQ880890zbMATH OpenOpenAlexFDO

Authors Guillaume Chauvet, Yves Tille

Publication date 29 May 2007

Published in Computational Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00180-006-0250-2

zbMATH Keywords

cube method of balanced samplingdemographySAS-IML

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Sampling theory, sample surveys (62D05) Applications of statistics to social sciences (62P25) Mathematical geography and demography (91D20)

Review text

The authors propose a new implementation for the cube method of balanced sampling. In their algorithm the population data never has to be completely loaded in memory and remains in a file that can be read sequentially. So restrictions on the population size are relaxed. The execution time depends linearly on the population size. The algorithm is implemented by means of a SAS-IML macro. The algorithm is applied to sociodemographic data on a population with 313,702 units and approximately 100 variables.

Recommendations

• On the optimality of balanced sampling
• Efficient balanced sampling: The cube method
• Fast balanced sampling for highly stratified population
• Fast sampling of perfectly uniform satisfying assignments
• An efficient parallel algorithm for random sampling
• scientific article; zbMATH DE number 3883579
• An efficient algorithm for random sampling without replacement
• A simulated annealing-based algorithm for selecting balanced samples
• Optimal allocation in balanced sampling

Cites work

• Efficient balanced sampling: The cube method
• On Rounding Percentages
• Robust Estimation in Finite Populations I
• Unequal probability sampling without replacement through a splitting method
• Variance approximation under balanced sampling

Cited in

(19)

• Fast balanced sampling for highly stratified population
• Alternative and complementary approaches to spatially balanced samples
• Exact balanced random imputation for sample survey data
• A simulated annealing-based algorithm for selecting balanced samples
• Balancing a sample almost perfectly
• Preserving the distribution function in surveys in case of imputation for zero inflated data
• Sample selection when a multivariate set of size measures is available
• Efficient balanced sampling: The cube method
• Coordination, combination and extension of balanced samples
• Ordered spatial sampling by means of the traveling salesman problem
• Balanced Sample Generation for Predicting the Mean of a Finite Population
• Variance estimation and asymptotic confidence bands for the mean estimator of sampled functional data with high entropy unequal probability sampling designs
• Spatially Balanced Sampling: A Review and A Reappraisal
• Optimal inclusion probabilities for balanced sampling
• A practical flight-phase approach to balanced random sampling
• Efficient case-cohort design using balanced sampling
• High-dimensional estimation in a survey sampling framework, model-assisted and calibration points of view
• Improved variance estimation for balanced samples drawn via the cube method
• Enhanced cube implementation for highly stratified population

Describes a project that uses

Uses Software

• SAS

This page was built for publication: A fast algorithm for balanced sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880890)