 Inclusion probabilities in partially rank ordered set samplingOmer Ozturk and Mohammad Jafari Jozani Computational Statistics & Data Analysis, 2014, vol. 69, issue C, 122-132 Abstract: In a finite population setting, this paper considers a partially rank ordered set (PROS) sampling design. The PROS design selects a simple random sample (SRS) of M units without replacement from a finite population and creates a partially rank ordered judgment subsets by dividing the units in SRS into subsets of a pre-specified size. The subsetting process creates a partial ordering among units in which each unit in subset h is considered to be smaller than every unit in subset h′ for h′>h. The PROS design then selects a unit for full measurement from one of these subsets. Remaining units are returned to the population based on three replacement policies. For each replacement policy, we compute the first and second order inclusion probabilities and use them to construct the Horvitz–Thompson estimator and its variance for the estimation of the population total and mean. It is shown that the replacement policy that does not return any of the M units, prior to selection of the next unit for full measurement, outperforms all other replacement policies. Keywords: Finite population; Horvitz–Thompson estimator; Partial ranking; Coefficient of variation; Ranked set sampling (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:csdana:v:69:y:2014:i:c:p:122-132 DOI: 10.1016/j.csda.2013.07.034 Access Statistics for this article Computational Statistics & Data Analysis is currently edited by S.P. Azen More articles in Computational Statistics & Data Analysis from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.