2009
DOI: 10.1111/j.1751-5823.2009.00093.x
|View full text |Cite
|
Sign up to set email alerts
|

A General Algorithm for Univariate Stratification

Abstract: This paper presents a general algorithm for constructing strata in a population using "X", a univariate stratification variable known for all the units in the population. Stratum "h" consists of all the units with an "X" value in the interval ["b" "h" - 1 , "b h") . The stratum boundaries {"b h"} are obtained by minimizing the anticipated sample size for estimating the population total of a survey variable "Y" with a given level of precision. The stratification criterion allows the presence of a take… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
22
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(23 citation statements)
references
References 19 publications
1
22
0
Order By: Relevance
“…In the case of a priori allocation, only a subset of pairings of all possible stratifications and allocations are considered; this subset is unlikely to contain the optimal allocation for a given objective function due to ignoring administrative data. The importance and improvements provided by assuming neither a priori allocation nor using conditional allocation are discussed and displayed through empirical results in Benedetti et al (2008), Day (2009), Baillargeon and Rivest (2009), and Ballin and Barcaroli (2013). A comparison of a priori allocated designs for multivariate surveys can be found in Kozak (2006b); further discussion can be found in Gonzalez and Eltinge (2010).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In the case of a priori allocation, only a subset of pairings of all possible stratifications and allocations are considered; this subset is unlikely to contain the optimal allocation for a given objective function due to ignoring administrative data. The importance and improvements provided by assuming neither a priori allocation nor using conditional allocation are discussed and displayed through empirical results in Benedetti et al (2008), Day (2009), Baillargeon and Rivest (2009), and Ballin and Barcaroli (2013). A comparison of a priori allocated designs for multivariate surveys can be found in Kozak (2006b); further discussion can be found in Gonzalez and Eltinge (2010).…”
Section: Introductionmentioning
confidence: 99%
“…In particular, an assumption that meeting quality constraints for the administrative variables may not imply meeting assumed quality constraints for the desired estimators. A discussion of this issue and proposed solution for univariate stratified designs using anticipated moments can be found in Baillargeon and Rivest (2009). Anticipated moments are moments of a random variable calculated under the sample design and the super population model (Isaki and Fuller 1982).…”
Section: Introductionmentioning
confidence: 99%
“…We used R package ‘stratification’ (Baillargeon & Rivest, , ) for computing strata with the cumf method. The number of classes used in computing the stratum breaks was set to 2000 × L , which was substantially larger than the recommended value of 15 × L .…”
Section: Methodsmentioning
confidence: 99%
“…Kozak's (2004) algorithm is a random search algorithm (RSM), whereas Keskintürk and Er's (2007) is a genetic algorithm (GA), so both are global optimization methods. The former has been found efficient by Baillargeon et al (2007) and Baillargeon and Rivest (2009) and proven to be more efficient than geometric stratification (Kozak and Verma, 2006). Yet there is no guarantee that it provides globally optimum stratification (Baillargeon et al, 2007, Baillargeon andRivest, 2009;Kozak, 2004).…”
Section: Introductionmentioning
confidence: 92%
“…The former has been found efficient by Baillargeon et al (2007) and Baillargeon and Rivest (2009) and proven to be more efficient than geometric stratification (Kozak and Verma, 2006). Yet there is no guarantee that it provides globally optimum stratification (Baillargeon et al, 2007, Baillargeon andRivest, 2009;Kozak, 2004). Keskintürk and Er (2007) also proved that their algorithm was more efficient than geometric stratification.…”
Section: Introductionmentioning
confidence: 92%