A fast algorithm for balanced sampling
type: Item
instance of: scholarly article
title: A fast algorithm for balanced sampling
zbMATH Open document ID: 1113.62143
author: Guillaume Chauvet
author: Yves Tille
published in: Computational Statistics
publication date: 2007-05-29T00:00:00Z
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.
Mathematics Subject Classification ID: 62P25
Mathematics Subject Classification ID: 91D20
Mathematics Subject Classification ID: 62-08
Mathematics Subject Classification ID: 62D05
zbMATH DE Number: 5158588
zbMATH Keywords: cube method of balanced sampling
zbMATH Keywords: demography
zbMATH Keywords: SAS-IML
describes a project that uses: SAS
MaRDI profile type: Publication
full work available at URL: s00180-006-0250-2
OpenAlex ID: W1993714383
cites work: Unequal probability sampling without replacement through a splitting method
cites work: Efficient balanced sampling: The cube method
cites work: Variance approximation under balanced sampling
cites work: Robust Estimation in Finite Populations I
cites work: On Rounding Percentages
DOI: 10.1007/S00180-006-0250-2
Recommended article: On the optimality of balanced sampling
Recommended article: Efficient balanced sampling: The cube method
Recommended article: Fast balanced sampling for highly stratified population
Recommended article: Fast sampling of perfectly uniform satisfying assignments
Recommended article: An efficient parallel algorithm for random sampling
Recommended article: Q3217575
Recommended article: An efficient algorithm for random sampling without replacement
Recommended article: A simulated annealing-based algorithm for selecting balanced samples
Recommended article: Optimal allocation in balanced sampling
description: scientific article; zbMATH DE number 5158588