A fast algorithm for balanced sampling (Q880890)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5158588
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for balanced sampling |
scientific article; zbMATH DE number 5158588 |
Statements
A fast algorithm for balanced sampling (English)
0 references
29 May 2007
0 references
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.
0 references
cube method of balanced sampling
0 references
demography
0 references
SAS-IML
0 references
0 references
0.8936692
0 references
0.8922208
0 references
0.88653994
0 references
0.87594306
0 references
0 references
0.86691195
0 references
0.8615538
0 references
