The ‘Bayesics’ of Ranked Set Sampling

被引:0
|
作者
Michael Lavin
机构
[1] Duke University,
关键词
Bayesian statisticsz; sampling design;
D O I
暂无
中图分类号
学科分类号
摘要
Ranked set sampling can be useful when measurements are expensive but units from the popu- lation can be easily ranked. In this situation one may draw k units from the population, rank them, select one on which to make the expensive measurement, draw another k units, rank them, select one, and so on. The method was originally suggested by McIntyre (1952) in connection with pasture yields and is obviously applicable in other situations as well. Dell and Clutter (1972) and Patil et al. (1994) explain the basics from a classical point of view. Our aim is to examine the procedure from a Bayesian point of view, determine whether ranked set sampling provides advantages over simple random sampling and explore some optimality questions
引用
收藏
页码:47 / 57
页数:10
相关论文
共 50 条