General ranked set sampling with cost considerations

Wang, You-Gan, Chen, Zehua and Liu, Jianbin (2004) General ranked set sampling with cost considerations. Biometrics, 60 2: 556-561. doi:10.1111/j.0006-341X.2004.00204.x


Author Wang, You-Gan
Chen, Zehua
Liu, Jianbin
Title General ranked set sampling with cost considerations
Journal name Biometrics   Check publisher's open access policy
ISSN 0006-341X
1541-0420
Publication date 2004-06
Sub-type Letter to editor, brief commentary or brief communication
DOI 10.1111/j.0006-341X.2004.00204.x
Volume 60
Issue 2
Start page 556
End page 561
Total pages 6
Place of publication Oxford, United Kingdom
Publisher Wiley-Blackwell
Language eng
Abstract Nahhas, Wolfe, and Chen (2002, Biometrics 58, 964-971) considered optimal set size for ranked set sampling (RSS) with fixed operational costs. This framework can be very useful in practice to determine whether RSS is beneficial and to obtain the optimal set size that minimizes the variance of the population estimator for a fixed total cost. In this article, we propose a scheme of general RSS in which more than one observation can be taken from each ranked set. This is shown to be more cost-effective in some cases when the cost of ranking is not so small. We demonstrate using the example in Nahhas, Wolfe, and Chen (2002, Biometrics 58, 964-971), by taking two or more observations from one set even with the optimal set size from the RSS design can be more beneficial.
Keyword Cost-effective design
Ranked set sampling
Sampling efficiency
Q-Index Code CX
Q-Index Status Provisional Code
Institutional Status Non-UQ

Document type: Journal Article
Sub-type: Letter to editor, brief commentary or brief communication
Collection: School of Mathematics and Physics
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 14 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 14 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Wed, 24 Nov 2010, 13:47:06 EST