An Extension of Sampford's Method for Unequal Probability Sampling

Abstract. Sampford's unequal probability sampling method is extended to the case that the inclusion probabilities do not sum to an integer. In this case, the sampling outcome is left open for exactly one randomly chosen unit and that unit gets a new inclusion probability. Three applications are presented. Two of them challenge traditional sampling routines. The simple Pareto sampling design, which was introduced by Rosén in 1997, is also extended. The extended Pareto design is shown to be close to the extended Sampford design.     

Negative Dependence in Sampling

Abstract. The strong Rayleigh property is a new and robust negative dependence property that implies negative association; in fact it implies conditional negative association closed under external fields (CNA+). Suppose that and are two families of 0‐1 random variables that satisfy the strong Rayleigh property and let . We show that {Z_i} conditioned on is also strongly Rayleigh; this turns out to be an easy consequence of the results on preservation of stability of polynomials of Borcea & Brändén (Invent. Math., 177, 2009, 521–569). This entails that a number of important π ps sampling algorithms, including Sampford sampling and Pareto sampling, are CNA+. As a consequence, statistics based on such samples automatically satisfy a version of the Central Limit Theorem for triangular arrays.     

Pareto Sampling versus Sampford and Conditional Poisson Sampling

Abstract.  Pareto sampling was introduced by Rosén in the late 1990s. It is a simple method to get a fixed size π ps sample though with inclusion probabilities only approximately as desired. Sampford sampling, introduced by Sampford in 1967, gives the desired inclusion probabilities but it may take time to generate a sample. Using probability functions and Laplace approximations, we show that from a probabilistic point of view these two designs are very close to each other and asymptotically identical. A Sampford sample can rapidly be generated in all situations by letting a Pareto sample pass an acceptance–rejection filter. A new very efficient method to generate conditional Poisson ( CP ) samples appears as a byproduct. Further, it is shown how the inclusion probabilities of all orders for the Pareto design can be calculated from those of the CP design. A new explicit very accurate approximation of the second-order inclusion probabilities, valid for several designs, is presented and applied to get single sum type variance estimates of the Horvitz–Thompson estimator.     

Sampling from spatial databases

This paper deals with techniques for obtaining random point samples from spatial databases. We seek random points from a continuous domain (usually ²) which satisfy a spatial predicate that is represented in the database as a collection of polygons. Several applications of spatial sampling (e.g. environmental monitoring, agronomy, forestry, etc) are described. Sampling problems are characterized in terms of two key parameters: coverage (selectivity), and expected stabbing number (overlap). We discuss two fundamental approaches to sampling with spatial predicates, depending on whether we sample first or evaluate the predicate first. The approaches are described in the context of both quadtrees and R-trees, detailing the sample first, acceptance/rejection tree, and partial area tree algorithms. A sequential algorithm, the one-pass spatial reservoir algorithm is also described. The relative performance of the various sampling algorithms is compared and choice of preferred algorithms is suggested. We conclude with a short discussion of possible extensions.     

Two-Stage Cluster Sampling with Ranked Set Sampling in the Secondary Sampling Frame

Motivated by a real-life problem, we develop a Two-Stage Cluster Sampling with Ranked Set Sampling (TSCRSS) design in the second stage for which we derive an unbiased estimator of population mean and its variance. An unbiased estimator of the variance of mean estimator is also derived. It is proved that the TSCRSS is more efficient—in the sense of having smaller variance—than the conventional two-stage cluster simple random sampling in which the second-stage sampling is with replacement. Using a simulation study on a real-life population, we show that the TSCRSS is more efficient than the conventional two-stage cluster sampling when simple random sampling without replacement is used in both stages.     

Calibration Weighting in Stratified Random Sampling

A new calibration estimator is proposed to estimate the population mean in the stratified random sampling. The corrected expression of Tracy et al. (2003) calibrated weights are presented and new improved calibration weights are introduced. Theoretical variance of the suggested estimator is discussed. Also a simulation study is carried out to show the properties of the proposed estimator.     

Star-Type Systematic Sampling Schemes for Finite Populations

Two new sampling schemes namely, Star-Type Systematic (STS) sampling without replacement and Modified Star-Type Systematic (MSTS) sampling without replacement for estimation of finite population means are introduced. The relative performances of the proposed star-type systematic sample means along with those of the simple random and systematic sample means are assessed for a hypothetical population with a linear trend and also for certain natural populations. Furthermore, the usefulness of the proposed sampling schemes in quality control and for constructing partial diallel crosses in mating designs are briefly break discussed.     

Bayesian inference and prediction of the Pareto distribution based on ordered ranked set sampling

In this paper, order statistics from independent and non identically distributed random variables is used to obtain ordered ranked set sampling (ORSS). Bayesian inference of unknown parameters under a squared error loss function of the Pareto distribution is determined. We compute the minimum posterior expected loss (the posterior risk) of the derived estimates and compare them with those based on the corresponding simple random sample (SRS) to assess the efficiency of the obtained estimates. Two-sample Bayesian prediction for future observations is introduced by using SRS and ORSS for one- and m-cycle. A simulation study and real data are applied to show the proposed results.     

Unbiased Estimation of the Distribution Function of an Exponential Population Using Order Statistics with Application in Ranked Set Sampling

In this paper we consider the problem of unbiased estimation of the distribution function of an exponential population using order statistics based on a random sample. We present a (unique) unbiased estimator based on a single, say ith, order statistic and study some properties of the estimator for i = 2. We also indicate how this estimator can be utilized to obtain unbiased estimators when a few selected order statistics are available as well as when the sample is selected following an alternative sampling procedure known as ranked set sampling. It is further proved that for a ranked set sample of size two, the proposed estimator is uniformly better than the conventional nonparametric unbiased estimator, further, for a general sample size, a modified ranked set sampling procedure provides an unbiased estimator uniformly better than the conventional nonparametric unbiased estimator based on the usual ranked set sampling procedure.     

Estimation of Population Mean in the Presence of Linear Trend

The present article deals with some methods for estimation of finite populations means in the presence of linear trend among the population values. As a result, we provided a strategy for the selection of sampling interval k for the case of circular systematic sampling, which ensures better estimator for the population mean compared to other choices of the sampling interval. This has been established based on empirical studies. Further we more, applied multiple random starts methods for selecting random samples for the case of linear systematic sampling and diagonal systematic sampling schemes. We also derived the explicit expressions for the variances and their estimates. The relative performances of simple random sampling, linear systematic sampling and diagonal systematic sampling schemes with single and multiple random starts are also assessed based on numerical examples.     

Approximating Symmetric Distributions via Sampling and Coefficient of Variation

Abstract

The Coefficient of Variation is one of the most commonly used statistical tool across various scientific fields. This paper proposes a use of the Coefficient of Variation, obtained by Sampling, to define the polynomial probability density function (pdf) of a continuous and symmetric random variable on the interval [a, b]. The basic idea behind the first proposed algorithm is the transformation of the interval from [a, b] to [0, b-a]. The chi-square goodness-of-fit test is used to compare the proposed (observed) sample distribution with the expected probability distribution. The experimental results show that the collected data are approximated by the proposed pdf. The second algorithm proposes a new method to get a fast estimate for the degree of the polynomial pdf when the random variable is normally distributed. Using the known percentages of values that lie within one, two and three standard deviations of the mean, respectively, the so-called three-sigma rule of thumb, we conclude that the degree of the polynomial pdf takes values between 1.8127 and 1.8642. In the case of a Laplace (μ, b) distribution, we conclude that the degree of the polynomial pdf takes values greater than 1. All calculations and graphs needed are done using statistical software R.     

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.     

Unbiased Estimation of P(X > Y) for Exponential Populations Using Order Statistics with Application in Ranked Set Sampling

This paper addresses the problem of unbiased estimation of P[X > Y] = θ for two independent exponentially distributed random variables X and Y. We present (unique) unbiased estimator of θ based on a single pair of order statistics obtained from two independent random samples from the two populations. We also indicate how this estimator can be utilized to obtain unbiased estimators of θ when only a few selected order statistics are available from the two random samples as well as when the samples are selected by an alternative procedure known as ranked set sampling. It is proved that for ranked set samples of size two, the proposed estimator is uniformly better than the conventional non-parametric unbiased estimator and further, a modified ranked set sampling procedure provides an unbiased estimator even better than the proposed estimator.     

An efficient non-rejective implementation of the πps sampling designs

Poisson sampling is a method for unequal probabilities sampling with random sample size. There exist several implementations of the Poisson sampling design, with fixed sample size, which almost all are rejective methods, that is, the sample is not always accepted. Thus, the existing methods can be time-consuming or even infeasible in some situations. In this paper, a fast and non-rejective method, which is efficient even for large populations, is proposed and studied. The method is a new design for selecting a sample of fixed size with unequal inclusion probabilities. For the population of large size, the proposed design is very close to the strict πps sampling which is similar to the conditional Poisson (CP) sampling design, but the implementation of the design is much more efficient than the CP sampling. And the inclusion probabilities can be calculated recursively.     

使用普查数据模拟MPPS抽样方法的研究

MPPS抽样即多变量与规模成比例的概率抽样,是20世纪90年代才提出来的一种抽样设计。近年来,中国有关部门与美国农业部国家农业署合作,进行了MPPS抽样设计的试点,来解决多目标调查问题。但是MPPS抽样在中国的应用非常有限。对MPPS抽样进行简单的回顾,介绍了它的基本估计,并对其应用进行了数据模拟研究。模拟中采用了系统抽样和泊松抽样的方法,根据实际调查数据得到了明确的结果。还对泊松抽样的一种变形永久随机数抽样的方法进行了模拟研究,并对它的一种误用情况进行了模拟比较,得到了具有说服力的结果。     

Estimation of Finite Population Mean in Stratified Random Sampling with Two Auxiliary Variables under Double Sampling Design

In this article, a chain ratio-product type exponential estimator is proposed for estimating finite population mean in stratified random sampling with two auxiliary variables under double sampling design. Theoretical and empirical results show that the proposed estimator is more efficient than the existing estimators, i.e., usual stratified random sample mean estimator, Chand (1975) chain ratio estimator, Choudhary and Singh (2012) estimator, chain ratio-product-type estimator, Sahoo et al. (1993) difference type estimator, and Kiregyera (1984) regression-type estimator. Two data sets are used to illustrate the performances of different estimators.     

Fast and Stable Algorithms for Computing and Sampling From the Noncentral Hypergeometric Distribution

Although the noncentral hypergeometric distribution underlies conditional inference for 2 × 2 tables, major statistical packages lack support for this distribution. This article introduces fast and stable algorithms for computing the noncentral hypergeometric distribution and for sampling from it. The algorithms avoid the expensive and explosive combinatorial numbers by using a recursive relation. The algorithms also take advantage of the sharp concentration of the distribution around its mode to save computing time. A modified inverse method substantially reduces the number of searches in generating a random deviate. The algorithms are implemented in a Java class, Hypergeometric, available on the World Wide Web.     

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.     

A New Sampling Design for Systematic Sampling

A sampling design called “Modified Systematic Sampling (MSS)” is proposed. In this design each unit has an equal probability of selection. Moreover, it works for both situations: N = nk or N ≠ nk. Consequently, the Linear Systematic Sampling (LSS) and Circular Systematic Sampling (CSS) become special cases of the proposed MSS design.     

Confidence Intervals for the Median of a Finite Population Based on the Sign Test

This article presents methods for constructing confidence intervals for the median of a finite population under simple random sampling without replacement, stratified random sampling, and cluster sampling. The confidence intervals, as well as point estimates and test statistics, are derived from sign estimating functions which are based on the well-known sign test. Therefore, a unified approach for inference about the median of a finite population is given.