Efficiency bounds for a generalization of ranked-set sampling

DOI10.1080/03610926.2013.835418MaRDI QIDQ2807721zbMATH OpenOpenAlexFDO

Authors Timothy G. Feeman, Jesse Frey

Publication date 25 May 2016

Published in Communications in Statistics. Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610926.2013.835418

zbMATH Keywords

eigenvaluescalculus of variationsmajorizationquantile functionimperfect rankingspartially rank-ordered set sampling

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Sampling theory, sample surveys (62D05) Order statistics; empirical distribution functions (62G30)

Recommendations

• Efficiency comparisons for partially rank-ordered set sampling
• Pair Rank Set Sampling
• On the theory of ranked-set sampling and its ramifications
• Random ranked set samples
• On the totality of ranked set sampling

Cites work

• scientific article; zbMATH DE number 3063288 (Why is no real title available?)
• A New Ranked Set Sample Estimator of Variance
• An improved mean estimator for judgment post-stratification
• Inequalities: theory of majorization and its applications
• Majorization: here, there and everywhere
• On unbiased estimates of the population mean based on the sample stratified by means of ordering
• Order Statistics
• Quantile inference based on partially rank-ordered set samples
• Ranked set sampling theory with order statistics background
• Two sample distribution-free inference based on partially rank-ordered set samples
• U-Statistics and imperfect ranking in ranked set sampling

Cited in

(8)

• General Ranked Set Sampling with Cost Considerations
• Lower Bound for the Average Sample Size and the Efficiency of Ranking Sequential Procedures
• Bottom-k and priority sampling, set similarity and subset sums with minimal independence
• Finding the maximum efficiency for multistage ranked-set sampling
• Bounds on the efficiency of unbalanced ranked-set sampling
• Efficiency comparisons for partially rank-ordered set sampling
• An algorithm with applications in ranked-set sampling
• On a partially sequential ranked set sampling paradigm

This page was built for publication: Efficiency bounds for a generalization of ranked-set sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807721)