Recursive computation of inclusion probabilities in ranked-set sampling

We derive recursive algorithms for computing first-order and second-order inclusion probabilities for ranked-set sampling from a finite population. These algorithms make it practical to compute inclusion probabilities even for relatively large sample and population sizes. As an application, we use the inclusion probabilities to examine the performance of Horvitz-Thompson estimators under different varieties of balanced ranked-set sampling. We find that it is only for balanced Level 2 sampling that the Horvitz-Thompson estimator can be relied upon to outperform the simple random sampling mean estimator.     

A review of nonparametric ranked-set sampling methodology

Ranked-set sampling is an alternative to random sampling for settings in which measurements are difficult or costly. Ranked-set sampling utilizes information gained without measurement to structure the eventual measured sample. This additional information yields improved properties for ranked-set sample procedures relative to their simple random sample counterparts. We review the available nonparametric procedures for data from ranked-set samples. Estimation of the distribution function was the first nonparametric setting to which ranked-set sampling methodology was applied. Since the first paper on the ranked-set sample empirical distribution function, the two-sample location setting, the sign test, and the signed-rank test have all been examined for ranked-set samples. In addition, estimation of the distribution function has been considered in a more general setting. We discuss the similarities and differences in the properties of the ranked-set sample procedures for the various settings     

Robust extreme ranked set sampling

In this paper, a robust extreme ranked set sampling (RERSS) procedure for estimating the population mean is introduced. It is shown that the proposed method gives an unbiased estimator with smaller variance, provided the underlying distribution is symmetric. However, for asymmetric distributions a weighted mean is given, where the optimal weights are computed by using Shannon's entropy. The performance of the population mean estimator is discussed along with its properties. Monte Carlo simulations are used to demonstrate the performance of the RERSS estimator relative to the simple random sample (SRS), ranked set sampling (RSS) and extreme ranked set sampling (ERSS) estimators. The results indicate that the proposed estimator is more efficient than the estimators based on the traditional sampling methods.     

Finding the maximum efficiency for multistage ranked-set sampling

Multistage ranked-set sampling (MRSS) is a generalization of ranked-set sampling in which multiple stages of ranking are used. It is known that for a fixed distribution under perfect rankings, each additional stage provides a gain in efficiency when estimating the population mean. However, the maximum possible efficiency for the MRSS sample mean relative to the simple random sampling sample mean has not previously been determined. In this paper, we provide a method for computing this maximum possible efficiency under perfect rankings for any choice of the set size and the number of stages. The maximum efficiency tends to infinity as the number of stages increases, and, for large numbers of stages, the efficiency-maximizing distributions are symmetric multi-modal distributions where the number of modes matches the set size. The results in this paper correct earlier assertions in the literature that the maximum efficiency is bounded and that it is achieved when the distribution is uniform.     

Selected Ranked Set Sampling

This paper proposes a sampling procedure called selected ranked set sampling (SRSS), in which only selected observations from a ranked set sample (RSS) are measured. This paper describes the optimal linear estimation of location and scale parameters based on SRSS, and for some distributions it presents the required tables for optimal selections. For these distributions, the optimal SRSS estimators are compared with the other popular simple random sample (SRS) and RSS estimators. In every situation the estimators based on SRSS are found advantageous at least in some respect, compared to those obtained from SRS or RSS. The SRSS method with errors in ranking is also described. The relative precision of the estimator of the population mean is investigated for different degrees of correlations between the actual and erroneous ranking. The paper reports the minimum value of the correlation coefficient between the actual and the erroneous ranking required for achieving better precision with respect to the usual SRS estimator and with respect to the RSS estimator.     

Efficiency bounds for a generalization of ranked-set sampling

Abstract

Partially rank-ordered set sampling (PROSS) is a generalization of ranked-set sampling (RSS) in which the ranker is not required to give a full ranking in each set. In this paper, we compare the efficiency of the sample mean as an estimator of the population mean under PROSS, RSS, and simple random sampling (SRS). We find that for fixed set size and total sample size, the efficiency of PROSS falls between that of SRS and that of RSS. We also develop a method for finding a sharp upper bound on the efficiency of PROSS relative to SRS for a particular design.     

Nonparametric Estimation for Random Censored Data Based on Ranking Set Sampling

In the case where the population distribution is unknown, the Kaplan–Meier estimator of the reliability function based on a ranked set sample with random right-censored data is first proposed. It is shown to be a unique self-consistent estimator. Then, the censored RSS estimator of the population mean is constructed. A simulation study is conducted to compare the performance of the proposed estimators with the corresponding estimators based on a simple random sample. It is shown that the ranked set sampling has higher efficiency. Finally, the proposed method is applied to a renal carcinoma study.     

L Ranked Set Sampling: A Generalization Procedure for Robust Visual Sampling

In this article, a robust ranked set sampling (LRSS) scheme for estimating population mean is introduced. The proposed method is a generalization for many types of ranked set sampling that introduced in the literature for estimating the population mean. It is shown that the LRSS method gives unbiased estimator for the population mean with minimum variance providing that the underlying distribution is symmetric. However, for skewed distributions a weighted mean is given, where the optimal weights is computed by using Shannon's entropy. The performance of the population mean estimator is discussed along with its properties. Monte Carlo comparisons for detecting outliers are made with the traditional simple random sample and the ranked set sampling for some distributions. The results indicate that the LRSS estimator is superior alternative to the existing methods.     

Steady-state ranked set sampling and parametric estimation

Ranked set sampling (RSS) was first used to obtain a more efficient estimator of the population mean, as compared to the one based on simple random sampling. This technique is useful when judgment ordering of a simple random sample (SRS) of small size can be done easily and fairly accurately, but exact measurement of an observation is difficult and expensive. It is noted that, due to the complicated likelihood, parametric estimation with RSS is difficult. In this article, the notion of steady-state RSS is introduced, its relation to stratified sampling is established, and its possible use in parametric estimation is explored and put forward for further investigations.     

A nonparametric estimator of the number of classes based on a stratified random sample

Under stratified random sampling, we develop a k^th-order bootstrap bias-corrected estimator of the number of classes θ which exist in a study region. This research extends Smith and van Belle’s (1984) first-order bootstrap bias-corrected estimator under simple random sampling. Our estimator has applicability for many settings including: estimating the number of animals when there are stratified capture periods, estimating the number of species based on stratified random sampling of subunits (say, quadrats) from the region, and estimating the number of errors/defects in a product based on observations from two or more types of inspectors. When the differences between the strata are large, utilizing stratified random sampling and our estimator often results in superior performance versus the use of simple random sampling and its bootstrap or jackknife [Burnham and Overton (1978)] estimator. The superior performance is often associated with more observed classes, and we provide insights into optimal designation of the strata and optimal allocation of sample sectors to strata.     

Efficient estimators for adaptive stratified sequential sampling

In stratified sampling, methods for the allocation of effort among strata usually rely on some measure of within-stratum variance. If we do not have enough information about these variances, adaptive allocation can be used. In adaptive allocation designs, surveys are conducted in two phases. Information from the first phase is used to allocate the remaining units among the strata in the second phase. Brown et al. [Adaptive two-stage sequential sampling, Popul. Ecol. 50 (2008), pp. 239–245] introduced an adaptive allocation sampling design – where the final sample size was random – and an unbiased estimator. Here, we derive an unbiased variance estimator for the design, and consider a related design where the final sample size is fixed. Having a fixed final sample size can make survey-planning easier. We introduce a biased Horvitz–Thompson type estimator and a biased sample mean type estimator for the sampling designs. We conduct two simulation studies on honey producers in Kurdistan and synthetic zirconium distribution in a region on the moon. Results show that the introduced estimators are more efficient than the available estimators for both variable and fixed sample size designs, and the conventional unbiased estimator of stratified simple random sampling design. In order to evaluate efficiencies of the introduced designs and their estimator furthermore, we first review some well-known adaptive allocation designs and compare their estimator with the introduced estimators. Simulation results show that the introduced estimators are more efficient than available estimators of these well-known adaptive allocation designs.     

A Generalized Class of Ratio Type Exponential Estimators of Population Mean Under Linear Transformation of Auxiliary Variable

Recently, Shabbir and Gupta [Shabbir, J. and Gupta, S. (2011). On estimating finite population mean in simple and stratified random sampling. Communications in Statistics-Theory and Methods, 40(2), 199–212] defined a class of ratio type exponential estimators of population mean under a very specific linear transformation of auxiliary variable. In the present article, we propose a generalized class of ratio type exponential estimators of population mean in simple random sampling under a very general linear transformation of auxiliary variable. Shabbir and Gupta's [Shabbir, J. and Gupta, S. (2011). On estimating finite population mean in simple and stratified random sampling. Communications in Statistics-Theory and Methods, 40(2), 199–212] class of estimators is a particular member of our proposed class of estimators. It has been found that the optimal estimator of our proposed generalized class of estimators is always more efficient than almost all the existing estimators defined under the same situations. Moreover, in comparison to a few existing estimators, our proposed estimator becomes more efficient under some simple conditions. Theoretical results obtained in the article have been verified by taking a numerical illustration. Finally, a simulation study has been carried out to see the relative performance of our proposed estimator with respect to some existing estimators which are less efficient under certain conditions as compared to the proposed estimator.     

Variance reduction of estimators arising from Metropolis–Hastings algorithms

The Metropolis–Hastings algorithm is one of the most basic and well-studied Markov chain Monte Carlo methods. It generates a Markov chain which has as limit distribution the target distribution by simulating observations from a different proposal distribution. A proposed value is accepted with some particular probability otherwise the previous value is repeated. As a consequence, the accepted values are repeated a positive number of times and thus any resulting ergodic mean is, in fact, a weighted average. It turns out that this weighted average is an importance sampling-type estimator with random weights. By the standard theory of importance sampling, replacement of these random weights by their (conditional) expectations leads to more efficient estimators. In this paper we study the estimator arising by replacing the random weights with certain estimators of their conditional expectations. We illustrate by simulations that it is often more efficient than the original estimator while in the case of the independence Metropolis–Hastings and for distributions with finite support we formally prove that it is even better than the “optimal” importance sampling estimator.     

Multiple-start balanced modified systematic sampling in the presence of linear trend

ABSTRACT

In this paper, we propose a sampling design termed as multiple-start balanced modified systematic sampling (MBMSS), which involves the supplementation of two or more balanced modified systematic samples, thus permitting us to obtain an unbiased estimate of the associated sampling variance. There are five cases for this design and in the presence of linear trend only one of these cases is optimal. To further improve results for the other cases, we propose an estimator that removes linear trend by applying weights to the first and last sampling units of the selected balanced modified systematic samples and is thus termed as the MBMSS with end corrections (MBMSSEC) estimator. By assuming a linear trend model averaged over a super-population model, we will compare the expected mean square errors (MSEs) of the proposed sample means, to that of simple random sampling (SRS), linear systematic sampling (LSS), stratified random sampling (STR), multiple-start linear systematic sampling (MLSS), and other modified MLSS estimators. As a result, MBMSS is optimal for one of the five possible cases, while the MBMSSEC estimator is preferred for three of the other four cases.     

Estimation of finite population mean in simple and stratified random sampling using two auxiliary variables

We propose an improved difference-cum-exponential ratio type estimator for estimating the finite population mean in simple and stratified random sampling using two auxiliary variables. We obtain properties of the estimators up to first order of approximation. The proposed class of estimators is found to be more efficient than the usual sample mean estimator, ratio estimator, exponential ratio type estimator, usual two difference type estimators, Rao (1991) estimator, Gupta and Shabbir (2008) estimator, and Grover and Kaur (2011) estimator. We use six real data sets in simple random sampling and two in stratified sampling for numerical comparisons.     

The mg-procedure in ranked set sampling

The MG-procedure in ranked set sampling is studied in this paper. It is shown that the MG-procedure with any selective probability matrix provides a more efficient estimator than the sample mean based on simple random sampling. The optimum selective probability matrix in the procedure is obtained and the estimator based on it is shown to be more efficient than that studied by Yanagawa and Shirahata [5]. The median-mean estimator, which is more efficient and could be easier to apply than that proposed by McIntyre [2] and Takahashi and Wakinoto [3], is proposed when the underlying distribution function belongs to a certain subfamily of symmetric distribution functions which includes the normal, logistic and double exponential distributions among others.     

A Mixed Model-assisted Regression Estimator that Uses Variables Employed at the Design Stage

The Generalized regression estimator (GREG) of a finite population mean or total has been shown to be asymptotically optimal when the working linear regression model upon which it is based includes variables related to the sampling design. In this paper a regression estimator assisted by a linear mixed superpopulation model is proposed. It accounts for the extra information coming from the design in the random component of the model and saves degrees of freedom in finite sample estimation. This procedure combines the larger asymptotic efficiency of the optimal estimator and the greater finite sample stability of the GREG. Design based properties of the proposed estimator are discussed and a small simulation study is conducted to explore its finite sample performance.     

Empirical Bayes sequential estimation of a finite population mean

In this article, we consider the Bayes and empirical Bayes problem of the current population mean of a finite population when the sample data is available from other similar (m-1) finite populations. We investigate a general class of linear estimators and obtain the optimal linear Bayes estimator of the finite population mean under a squared error loss function that considered the cost of sampling. The optimal linear Bayes estimator and the sample size are obtained as a function of the parameters of the prior distribution. The corresponding empirical Bayes estimates are obtained by replacing the unknown hyperparameters with their respective consistent estimates. A Monte Carlo study is conducted to evaluate the performance of the proposed empirical Bayes procedure.     

Bootstrap confidence bands for the CDF using ranked-set sampling

In ranked-set sampling (RSS), a stratification by ranks is used to obtain a sample that tends to be more informative than a simple random sample of the same size. Previous work has shown that if the rankings are perfect, then one can use RSS to obtain Kolmogorov–Smirnov type confidence bands for the CDF that are narrower than those obtained under simple random sampling. Here we develop Kolmogorov–Smirnov type confidence bands that work well whether the rankings are perfect or not. These confidence bands are obtained by using a smoothed bootstrap procedure that takes advantage of special features of RSS. We show through a simulation study that the coverage probabilities are close to nominal even for samples with just two or three observations. A new algorithm allows us to avoid the bootstrap simulation step when sample sizes are relatively small.     

A conditional perspective of weighted variance estimation of the optimal regression estimator

The estimation of the variance for the GREG (general regression) estimator by weighted residuals is widely accepted as a method which yields estimators with good conditional properties. Since the optimal (regression) estimator shares the properties of GREG estimators which are used in the construction of weighted variance estimators, we introduce the weighting procedure also for estimating the variance of the optimal estimator. This method of variance estimation was originally presented in a seemingly ad hoc manner, and we shall discuss it from a conditional point of view and also look at an alternative way of utilizing the weights. Examples that stress conditional behaviour of estimators are then given for elementary sampling designs such as simple random sampling, stratified simple random sampling and Poisson sampling, where for the latter design we have conducted a small simulation study.