• Communications for Statistical Applications and Methods
• /
• v.24 no.3
• /
• pp.241-254
• /
• 2017

Drawing a sample can be costly or time consuming in some studies. However, it may be possible to rank the sampling units according to some baseline auxiliary covariates, which are easily obtainable, and/or cost efficient. Ranked set sampling (RSS) is a method to achieve this goal. In this paper, we propose a modified approach of the RSS method to allocate units into an experimental study that compares L groups. Computer simulation estimates the empirical nominal values and the empirical power values for the test procedure of comparing L different groups using modified RSS based on the regression approach in analysis of covariance (ANCOVA) models. A comparison to simple random sampling (SRS) is made to demonstrate efficiency. The results indicate that the required sample sizes for a given precision are smaller under RSS than under SRS. The modified RSS protocol was applied to an experimental study. The experimental study was designed to obtain a better understanding of the pathways by which positive experiences (i.e., goal completion) contribute to higher levels of happiness, well-being, and life satisfaction. The use of the RSS method resulted in a cost reduction associated with smaller sample size without losing the precision of the analysis.

• Communications for Statistical Applications and Methods
• /
• v.23 no.5
• /
• pp.385-397
• /
• 2016

The stress-strength models have been intensively investigated in the literature in regards of estimating the reliability ${\theta}$ = P(X > Y) using parametric and nonparametric approaches under different sampling schemes when X and Y are independent random variables. In this paper, we consider the problem of estimating ${\theta}$ when (X, Y) are dependent random variables with a bivariate underlying distribution. The empirical and kernel estimates of ${\theta}$ = P(X > Y), based on bivariate ranked set sampling (BVRSS) are considered, when (X, Y) are paired dependent continuous random variables. The estimators obtained are compared to their counterpart, bivariate simple random sampling (BVSRS), via the bias and mean square error (MSE). We demonstrate that the suggested estimators based on BVRSS are more efficient than those based on BVSRS. A simulation study is conducted to gain insight into the performance of the proposed estimators. A real data example is provided to illustrate the process.

• Journal of applied mathematics & informatics
• /
• v.3 no.2
• /
• pp.235-244
• /
• 1996

Ranked-set sampling is useful when measurements are destructive or costly to obtain but ranking of the observations is rel-atively easy. The Wilcoxon signed rank test statistic based on the ranked-set sample is considered. We compared the asymptotic relative efficiencies of the RSS Wilcoxon signed rank test statistics with respect to the SRS Wilcoxon signed rank test statistic and the RSS sign test statistic. Throughout the ARE's the proposed test statistic is superior to the SRS Wilcoxxon signed rank test statistic and the RSS sign test statistic.

• Communications for Statistical Applications and Methods
• /
• v.5 no.1
• /
• pp.133-144
• /
• 1998

In this paper, we propose the two-sample test statistic using Wilcoxon signed rank test on ranked-set sampling(RSS) and obtain the asymptotic relative efficiencies(ARE) of the proposed test statistic with respect to Mann-Whitney-Wilcoxon statistic on simple random sampling(SRS), the Mann-Whitney-Wilcoxon statistic on RSS, sign statistic on RSS and Wilcoxon signed rank test on SRS. From the simulation works, we compare the powers of the proposed test statistic, Mann-Whitney-Wilcoxon statistic on RSS, the usual two-sample t statistic, sign statistic on RSS, where the underlying distributions are uniform, normal, double exponential, logistic and Cauchy distributions.

• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.449-468
• /
• 2023

This paper deals in the study of the estimation of the parameters of Erlang distribution based on rank set sampling and some of its modifications. Here we considered Maximum Likelihood (ML) and the Bayesian technique to estimate the shape and scale parameter of Erlang distribution based on RSS and its some modifications such as ERSS, MRSS, and MRSSu. The derivation for unknown parameters of Erlang distribution is well presented using normal approximation to the asymptotic distribution of ML estimators. But due to the complexity involves in the integral, the Bayes estimator of unknown parameters is obtained using MCMC method. Further, we compared the MSE of estimation in different sampling schemes with different set sizes and cycle size. A real-life data application is also given to illustrate the efficiency of the proposed scheme.

• Communications for Statistical Applications and Methods
• /
• v.23 no.6
• /
• pp.543-553
• /
• 2016

The validity of statistical inference depends on proper randomization methods. However, even with proper randomization, we can have imbalanced with respect to important characteristics. In this paper, we introduce a method based on ranked auxiliary variables for treatment allocation in crossover designs using Latin squares models. We evaluate the improvement of the efficiency in treatment comparisons using the proposed method. Our simulation study reveals that our proposed method provides a more powerful test compared to simple randomization with the same sample size. The proposed method is illustrated by conducting an experiment to compare two different concentrations of titanium dioxide nanofiber (TDNF) on rats for the purpose of comparing weight gain.

• Journal of KIISE:Databases
• /
• v.41 no.4
• /
• pp.256-261
• /
• 2014

The problem of top-${\kappa}$ set similarity joins finds the top-${\kappa}$ pairs of records ranked by their similarities between two sets of input records. We propose an efficient algorithm to return top-${\kappa}$ similarity join pairs using a sampling technique. From a sample of the input records, we construct a histogram of set similarity joins, and then compute an estimated similarity threshold in the histogram for top-${\kappa}$ join pairs within the error bound of 95% confidence level based on statistical inference. Finally, the estimated threshold is applied to the traditional similarity join algorithm which uses the min-heap structure to get top-${\kappa}$ similarity joins. The experimental results show the good performance of the proposed algorithm on large real datasets.