On distribution function estimation with partially rank-ordered set samples: estimating mercury level in fish using length frequency data

We study the non-parametric estimation of a continuous distribution function F based on the partially rank-ordered set (PROS) sampling design. A PROS sampling design first selects a random sample from the underlying population and uses judgement ranking to rank them into partially ordered sets, without measuring the variable of interest. The final measurements are then obtained from one of the partially ordered sets. Considering an imperfect PROS sampling procedure, we first develop the empirical distribution function (EDF) estimator of F and study its theoretical properties. Then, we consider the problem of estimating F, where the underlying distribution is assumed to be symmetric. We also find a unique admissible estimator of F within the class of nondecreasing step functions with jumps at observed values and show the inadmissibility of the EDF. In addition, we introduce a smooth estimator of F and discuss its theoretical properties. Finally, we expand on various numerical illustrations of our results via several simulation studies and a real data application and show the advantages of PROS estimates over their counterparts under the simple random and ranked set sampling designs.     

Information content of partially rank-ordered set samples

Partially rank-ordered set (PROS) sampling is a generalization of ranked set sampling in which rankers are not required to fully rank the sampling units in each set, hence having more flexibility to perform the necessary judgemental ranking process. The PROS sampling has a wide range of applications in different fields ranging from environmental and ecological studies to medical research and it has been shown to be superior over ranked set sampling and simple random sampling for estimating the population mean. We study Fisher information content and uncertainty structure of the PROS samples and compare them with those of simple random sample (SRS) and ranked set sample (RSS) counterparts of the same size from the underlying population. We study uncertainty structure in terms of the Shannon entropy, Rényi entropy and Kullback–Leibler (KL) discrimination measures.     

Mixture Model Analysis of Partially Rank‐Ordered Set Samples: Age Groups of Fish from Length‐Frequency Data

We present a novel methodology for estimating the parameters of a finite mixture model (FMM) based on partially rank‐ordered set (PROS) sampling and use it in a fishery application. A PROS sampling design first selects a simple random sample of fish and creates partially rank‐ordered judgement subsets by dividing units into subsets of prespecified sizes. The final measurements are then obtained from these partially ordered judgement subsets. The traditional expectation–maximization algorithm is not directly applicable for these observations. We propose a suitable expectation–maximization algorithm to estimate the parameters of the FMMs based on PROS samples. We also study the problem of classification of the PROS sample into the components of the FMM. We show that the maximum likelihood estimators based on PROS samples perform substantially better than their simple random sample counterparts even with small samples. The results are used to classify a fish population using the length‐frequency data.     

Sign test based on k-tuple general ranked set samples

ABSTRACT

The sign test based on the k-tuple ranked set samples is discussed here. We first derive the distribution of the k-tuple ranked set sample sign test statistic, and then the asymptotic distribution is also obtained. We then compare its performance with its counterparts based on simple random sample and classical ranked set sample. The asymptotic relative efficiency and the power are then derived. Finally, the effect of imperfect ranking on the procedure is assessed.     

Inference in the presence of ranking error in ranked set sampling

The author proposes inference techniques for ranked set sample data in the presence of judgment ranking errors. He bases his analysis on the models of Bohn & Wolfe (1994) and Frey (2007a, b), of which parameters are estimated by minimizing a distance measure. He then uses the fitted models to calibrate confidence intervals and tests. He shows the validity of his approach through simulation and illustrates its application through the construction of distribution‐free confidence intervals for the median area of apple tree leaves covered by a spray.     

Exact Inference for a Population Proportion Based on a Ranked Set Sample

ABSTRACT

This article develops and investigates a confidence interval and hypothesis testing procedure for a population proportion based on a ranked set sample (RSS). The inference is exact, in the sense that it is based on the exact distribution of the total number of successes observed in the RSS. Furthermore, this distribution can be readily computed with the well-known and freely available R statistical software package. A data example that illustrates the methodology is presented. In addition, the properties of the inference procedures are compared with their simple random sample (SRS) counterparts. In regards to expected lengths of confidence intervals and the power of tests, the RSS inference procedures are superior to the SRS methods.     

Inference Based on General Linear Models for Order Restricted Randomization

This article develops statistical inference for the general linear models in order restricted randomized (ORR) designs. The ORR designs use the heterogeneity among experimental units to induce a negative correlation structure among responses obtained from different treatment regimes. This negative correlation structure acts as a variance reduction technique for treatment contrast. The parameters of the general linear models are estimated and a generalized F-test is constructed for its components. It is shown that the null distribution of the test statistic can be approximated reasonably well with an F-distribution for moderate sample sizes. It is also shown that the empirical power of the proposed test is substantially higher than the powers of its competitors in the literature. The proposed test and estimator are applied to a data set from a clinical trial to illustrate how one can improve such an experiment.     

Multi-sample inference for simple-tree alternatives with ranked-set samples

This paper develops a non‐parametric multi‐sample inference for simple‐tree alternatives for ranked‐set samples. The multi‐sample inference provides simultaneous one‐sample sign confidence intervals for the population medians. The decision rule compares these intervals to achieve the desired type I error. For the specified upper bounds on the experiment‐wise error rates, corresponding individual confidence coefficients are presented. It is shown that the testing procedure is distribution‐free. To achieve the desired confidence coefficients for multi‐sample inference, a nonparametric confidence interval is constructed by interpolating the adjacent order statistics. Interpolation coefficients and coverage probabilities are provided, along with the nominal levels.     

Power comparison of the Kolmogorov–Smirnov test under ranked set sampling and simple random sampling

Many studies have been used to compare the power of several goodness-of-fit (GOF) tests under simple random sampling (SRS) and ranked set sampling (RSS). In our study, a different design procedure and ranking process in RSS are thoroughly investigated. A simulation study is conducted to compare the power of the Kolmogorov–Smirnov test under SRS and RSS with different sets and cycle sizes for several distributions. Level-2 sampling design and partially rank-ordered sets are used. Also, we benefited from auxiliary variables in the ranking process. Finally, results are presented with tables and figures. Under these conditions we show that the RSS has better performance against the SRS in finite population.     

Ranked set sample inference under a symmetry restriction

This paper considers statistical inference for a ranked set sample under a symmetry restriction on the underlying distribution. We present new estimators for the distribution function and the center of symmetry. It is shown that these estimators outperform their competitors in the literature. Based on the proposed distribution function estimator, a Kolmogorov–Smirnov type test is developed and the construction of a confidence interval is discussed.     

A new ranked set sampling protocol for the signed rank test

In this paper, we construct a new ranked set sampling protocol that maximizes the Pitman asymptotic efficiency of the signed rank test. The new sampling design is a function of the set size and independent order statistics. If the set size is odd and the underlying distribution is symmetric and unimodal, then the new sampling protocol quantifies only the middle observation. On the other hand, if the set size is even, the new sampling design quantifies the two middle observations. This data collection procedure for use in the signed rank test outperforms the data collection procedure in the standard ranked set sample. We show that the exact null distribution of the signed rank statistic W_RSS⁺ based on a data set generated by the new ranked set sample design for odd set sizes is the same as the null distribution of the simple random sample signed rank statistic W_SRS⁺ based on the same number of measured observations. For even set sizes, the exact null distribution of W_RSS⁺ is simulated.     

A Jonckheere-Terpstra-type test for perfect ranking in balanced ranked set sampling

Many methods based on ranked set sampling (RSS) assume perfect ranking of the samples. Here, by using the data measured by a balanced RSS scheme, we propose a nonparametric test for the assumption of perfect ranking. The test statistic that we use formally corresponds to the Jonckheere-Terpstra-type test statistic. We show formal relations of the proposed test for perfect ranking to other methods proposed recently in the literature. Through an empirical power study, we demonstrate that the proposed method performs favorably compared to many of its competitors.     

Efficiency of ranked set sampling in entropy estimation and goodness-of-fit testing for the inverse Gaussian law

When measuring units are expensive or time consuming, while ranking them is relatively easy and inexpensive, it is known that ranked set sampling (RSS) is preferable to simple random sampling (SRS). Many authors have suggested several extensions of RSS. As a variation, Al-Saleh and Al-Kadiri [Double ranked set sampling, Statist. Probab. Lett. 48 (2000), pp. 205–212] introduced double ranked set sampling (DRSS) and it was extended by Al-Saleh and Al-Omari [Multistage ranked set sampling, J. Statist. Plann. Inference 102 (2002), pp. 273–286] to multistage ranked set sampling (MSRSS). The entropy of a random variable (r.v.) is a measure of its uncertainty. It is a measure of the amount of information required on the average to determine the value of a (discrete) r.v.. In this work, we discuss entropy estimation in RSS design and aforementioned extensions and compare the results with those in SRS design in terms of bias and root mean square error (RMSE). Motivated by the above observed efficiency, we continue to investigate entropy-based goodness-of-fit test for the inverse Gaussian distribution using RSS. Critical values for some sample sizes determined by means of Monte Carlo simulations are presented for each design. A Monte Carlo power analysis is performed under various alternative hypotheses in order to compare the proposed testing procedure with the existing methods. The results indicate that tests based on RSS and its extensions are superior alternatives to the entropy test based on SRS.     

Estimation of population mean and variance in flock management: a ranked set sampling approach in a finite population setting

Ranked set sampling is a sampling technique that provides substantial cost efficiency in experiments where a quick, inexpensive ranking procedure is available to rank the units prior to formal, expensive and precise measurements. Although the theoretical properties and relative efficiencies of this approach with respect to simple random sampling have been extensively studied in the literature for the infinite population setting, the use of ranked set sampling methods has not yet been explored widely for finite populations. The purpose of this study is to use sheep population data from the Research Farm at Ataturk University, Erzurum, Turkey, to demonstrate the practical benefits of ranked set sampling procedures relative to the more commonly used simple random sampling estimation of the population mean and variance in a finite population. It is shown that the ranked set sample mean remains unbiased for the population mean as is the case for the infinite population, but the variance estimators are unbiased only with use of the finite population correction factor. Both mean and variance estimators provide substantial improvement over their simple random sample counterparts.     

Parametric estimation of location and scale parameters in ranked set sampling

This paper develops parametric inference for the parameters of location-scale family of distributions based on a ranked set sample. Likelihood function incorporates within-set ranking errors into the model through a missing data mechanism. The maximum likelihood estimators of the location-scale and missing data model parameters are constructed and an EM-algorithm is provided. It is shown that the proposed estimator is robust against imperfect ranking error and provides higher efficiency over its competitors.     

New imperfect rankings models for ranked set sampling

Ranked set sampling is a sampling approach that leads to improved statistical inference in situations where the units to be sampled can be ranked relative to each other prior to formal measurement. This ranking may be done either by subjective judgment or according to an auxiliary variable, and it need not be completely accurate. In fact, results in the literature have shown that no matter how poor the quality of the ranking, procedures based on ranked set sampling tend to be at least as efficient as procedures based on simple random sampling. However, efforts to quantify the gains in efficiency for ranked set sampling procedures have been hampered by a shortage of available models for imperfect rankings. In this paper, we introduce a new class of models for imperfect rankings, and we provide a rigorous proof that essentially any reasonable model for imperfect rankings is a limit of models in this class. We then describe a specific, easily applied method for selecting an appropriate imperfect rankings model from the class.     

Some simple nonparametric methods to test for perfect ranking in ranked set sampling

A lot of research on ranked set sampling (RSS) is based on the assumption that the ranking is perfect. Hence, it is necessary to develop some tests that could be used to validate this assumption of perfect ranking. In this paper, we introduce some simple nonparametric methods for this purpose. We specifically define three test statistics, _Nk,_Sk$N_k,S_k$ and _Ak$A_k$, based on one-cycle RSS, which are all associated with the ordered ranked set sample (ORSS). We then derive the exact null distributions and exact power functions of all these tests. Next, by using the sum or the maximum of each statistic over all cycles, we propose six test statistics for the case of multi-cycle RSS. We compare the performance of all these tests with that of the Kolmogorov–Smirnov test statistic proposed earlier by Stokes and Sager [1988. Characterization of a ranked-set sample with application to estimating distribution functions. J. Amer. Statist. Assoc. 83, 35–42] and display that all proposed test statistics are more powerful. Finally, we present an example to illustrate the test procedures discussed here.     

Combining multi‐observer information in partially rank‐ordered judgment post‐stratified and ranked set samples

This paper develops two sampling designs to create artificially stratified samples. These designs use a small set of experimental units to determine their relative ranks without measurement. In each set, the units are ranked by all available observers (rankers), with ties whenever the units cannot be ranked with high confidence. The rankings from all the observers are then combined in a meaningful way to create a single weight measure. This weight measure is used to create judgment strata in both designs. The first design constructs the strata through judgment post‐stratification after the data has been collected. The second design creates the strata before any measurements are made on the experimental units. The paper constructs estimators and confidence intervals, and develops testing procedures for the mean and median of the underlying distribution based on these sampling designs. We show that the proposed sampling designs provide a substantial improvement over their competitor designs in the literature. The Canadian Journal of Statistics 41: 304–324; 2013 © 2013 Statistical Society of Canada     

RANKED SET SAMPLING FROM LOCATION-SCALE FAMILIES OF SYMMETRIC DISTRIBUTIONS

Statistical inference based on ranked set sampling has primarily been motivated by nonparametric problems. However, the sampling procedure can provide an improved estimator of the population mean when the population is partially known. In this article, we consider estimation of the population mean and variance for the location-scale families of distributions. We derive and compare different unbiased estimators of these parameters based on rindependent replications of a ranked set sample of size n.Large sample properties, along with asymptotic relative efficiencies, help identify which estimators are best suited for different location-scale distributions.     

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.