On a sequential subset selection procedure for the least probable multinomial cell

This paper studies a sequential procedure R for selecting a random size subset that contains the multinomial cell which has the smallest cell probability. The stopping rule of the proposed procedure R is the composite of the stopping rules of curtailed sampling, inverse sampling, and the Ramey-Alam sampling. A reslut on the worst configuration is shown and it is employed in computing the procedure parameters that guarantee certain probability requirements. Tables of these procedure parameters, the corresponding probability of correct selection, the expected sample size, and the expected subset size are given for comparison purpose.     

Bayesian sequential methods for choosing the best multinomial cell: some simulation results

Suboptimal Bayesian sequential methods for choosing the best (i.e. largest probability) multinomial cell are considered and their performance is studied using Monte Carlo simulation. Performance characteristics, such as the probability of correct selection and some other associated with the sample size distribution, are evaluated assuming a maximum sample size. Single observation sequential rules as well as rules, where groups of observations are taken, and fixed sample size rules are discussed.     

Selection of the best with a preliminary test for two-parameter exponential distributions

This paper deals with the problem of selecting the best population from among k(≥ 2) two-parameter exponential populations. New selection procedures are proposed for selecting the unique best. The procedures include preliminary tests which allow the xperimenter to have an option to not select if the statistical evidence is not significant. Two probabilities, the probability to make a selection and the probability of a correct selection, are controlled by these selection procedures. Comparisons between the proposed selection procedures and certain earlier existing procedures are also made. The results show the superiority of the proposed selection procedures in terms of the required sample size.     

A subset selection procedure for multinomial distributions

A subset selection procedure is developed for selecting a subset containing the multinomial population that has the highest value of a certain linear combination of the multinomial cell probabilities; such population is called the ‘best’. The multivariate normal large sample approximation to the multinomial distribution is used to derive expressions for the probability of a correct selection, and for the threshold constant involved in the procedure. The procedure guarantees that the probability of a correct selection is at least at a pre-assigned level. The proposed procedure is an extension of Gupta and Sobel's [14] selection procedure for binomials and of Bakir's [2] restrictive selection procedure for multinomials. One illustration of the procedure concerns population income mobility in four countries: Peru, Russia, South Africa and the USA. Analysis indicates that Russia and Peru fall in the selected subset containing the best population with respect to income mobility from poverty to a higher-income status. The procedure is also applied to data concerning grade distribution for students in a certain freshman class.     

Conditional probability of correct selection under the continuum partition with applications

The problem of selecting the best population from among a finite number of populations in the presence of uncertainty is a problem one faces in many scientific investigations, and has been studied extensively, Many selection procedures have been derived for different selection goals. However, most of these selection procedures, being frequentist in nature, don't tell how to incorporate the information in a particular sample to give a data-dependent measure of correct selection achieved for this particular sample. They often assign the same decision and probability of correct selection for two different sample values, one of which actually seems intuitively much more conclusive than the other. The methodology of conditional inference offers an approach which achieves both frequentist interpret ability and a data-dependent measure of conclusiveness. By partitioning the sample space into a family of subsets, the achieved probability of correct selection is computed by conditioning on which subset the sample falls in. In this paper, the partition considered is the so called continuum partition, while the selection rules are both the fixed-size and random-size subset selection rules. Under the distributional assumption of being monotone likelihood ratio, results on least favourable configuration and alpha-correct selection are established. These re-sults are not only useful in themselves, but also are used to design a new sequential procedure with elimination for selecting the best of k Binomial populations. Comparisons between this new procedure and some other se-quential selection procedures with regard to total expected sample size and some risk functions are carried out by simulations.     

Approximations for a fixed sample size selection procedure for negative binomial populations

A large sample approximation of the least favorable configuration for a fixed sample size selection procedure for negative binomial populations is proposed. A normal approximation of the selection procedure is also presented. Optimal sample sizes required to be drawn from each population and the bounds for the sample sizes are tabulated. Sample sizes obtained using the approximate least favorable configuration are compared with those obtained using the exact least favorable configuration. Alternate form of the normal approximation to the probability of correct selection is also presented. The relation between the required sample size and the number of populations involved is studied.     

Lower bounds for expected sample size of sequential procedures for the multinomial selection problems

In this article, lower bounds for expected sample size of sequential selection procedures are constructed for the problem of selecting the most probable event of k-variate multinomial distribution. The study is based on Volodin’s universal lower bounds for expected sample size of statistical inference procedures. The obtained lower bounds are used to estimate the efficiency of some selection procedures in terms of their expected sample sizes.     

Multinomial Selection for Comparison with a Standard

The multinomial selection problem is considered under the formulation of comparison with a standard, where each system is required to be compared to a single system, referred to as a “standard,” as well as to other alternative systems. The goal is to identify systems that are better than the standard, or to retain the standard when it is equal to or better than the other alternatives in terms of the probability to generate the largest or smallest performance measure. We derive new multinomial selection procedures for comparison with a standard to be applied in different scenarios, including exact small-sample procedure and approximate large-sample procedure. Empirical results and the proof are presented to demonstrate the statistical validity of our procedures. The tables of the procedure parameters and the corresponding exact probability of correct selection are also provided.     

Designing selection experiments with bernoulli populations

This paper is concerned with a fixed size subset selection problem for Bernoulli populations in the framework of the indifference zone approach. The goal is to select s populationswhich contain at least c of those with the t largest success probabilities. In order to control the probability of correct selection over the preference zone extensive tables of exact minimum sample sizes have been prepared to implement the single-stage procedure generalized from the well-known Sobel-Huyett procedure. It is shown how the tables can also be employed to design certain closedsequential procedures. These procedures curtail the sampling process of the single-stage procedureand may differ in their sampling rules. Two procedures working with play-the-winner rules are described in detail     

Some comments on two-stage selection procedures

In this paper we study the procedures of Dudewicz and Dalal ( 1975 ), and the modifications suggested by Rinott ( 1978 ), for selecting the largest mean from k normal populations with unknown variances. We look at the case k = 2 in detail, because there is an optimal allocation scheme here. We do not really allocate the total number of samples into two groups, but we estimate this optimal sample size, as well, so as to guarantee the probability of correct selection (written as P(CS)) at least P^?, 1/2 < P^? < 1 . We prove that the procedure of Rinott is “asymptotically in-efficient” (to be defined below) in the sense of Chow and Robbins ( 1965 ) for any k  2. Next, we propose two-stage procedures having all the properties of Rinott's procedure, together with the property of “asymptotic efficiency” - which is highly desirable.     

A New Formulation For The Multinomial Selection Problem

The two approaches to a multinomial ranking and selection problem (for selecting the t best cells out of k are combined to form a new apprach. In this new approach there is a preference zone (PZ) and an indifference zone (IZ), and the concept of a correct selection (CS) is defined differentlv in eac of these zones. Lower bounds for the probability of correct selection p(CS) are then guaranteed in each of these zones using a single experiment. The procedure on the ordered frequencies in the cells. The principle tool used to derive expressins for the p(CS). for the expected sample size EN, for the expected subsct size ES and for other probabilities. is the Dirichlet integral (Type 2) which was recent tabulated. These Dirichlet integrals are used to prove that the multiplicative slippage configuratin is leas favorable in the PZ and, for t = l, that the IZ. Numerical calculations are carried out for an illustrative example but extensive tables are not yet avalable

     

A selection procedure for estimating the number of signal components

This paper proposes a selection procedure to estimate the multiplicity of the smallest eigenvalue of the covariance matrix. The unknown number of signals present in a radar data can be formulated as the difference between the total number of components in the observed multivariate data vector and the multiplicity of the smallest eigenvalue. In the observed multivariate data, the smallest eigenvalues of the sample covariance matrix may in fact be grouped about some nominal value, as opposed to being identically equal. We propose a selection procedure to estimate the multiplicity of the common smallest eigenvalue, which is significantly smaller than the other eigenvalues. We derive the probability of a correct selection, P(CS), and the least favorable configuration (LFC) for our procedures. Under the LFC, the P(CS) attains its minimum over the preference zone of all eigenvalues. Therefore, a minimum sample size can be determined from the P(CS) under the LFC, P(CS|LFC), in order to implement our new procedure with a guaranteed probability requirement. Numerical examples are presented in order to illustrate our proposed procedure.     

A modified subset selection formulation with special reference to one-way and two-way layout experiments

The usual formulation of subset selection due to Gupta (1956) requires a minimum guaranteed probability of a correct selection. The modified formulation of the present paper includes an additional requirement that the expected number of the nonbest populations be bounded above by a specified constant when the best and the next best populations are ‘sufficiently’ apart. A class of procedures is defined and the determination of the minimum sample size required is discussed. The specific problems discussed for normal populations include selection in terms of means and variances, and selection in terms of treatment effects in a two-way layout.     

Sequential unbiased estimation of parameters in a two-way contingency table

Classical analysis of contingency tables employs (i) fixed sample sizes and (ii) the maximum likelihood and weighted least squares approach to parameter estimation. It is well-known, however, that certain important parameters, such as the main effect and interaction parameters, can neverbe estimated unbiasedly when the sample size is fixed a priori We introduce a sequential unbiased estimator for the cell probabilities subject to log linear constraints. As a simple consequence, we show how parameters such as those mentioned above may. be estimated unbiasedly. Our unbiased estimator for the vector of cell probabilities is shown to be consistent in the sense of Wolfowitz (Ann. Math. Statist. (1947) 18). We give a sufficient condition on a multinomial stopping rule for the corresponding sufficient statistic to be complete. When this condition holds, we have a unique minimum variance unbiased estimator for the cell probabilities.     

Analyzing continuous randomized response data with an indifference-zone selection procedure

A review of the randomized response model introduced by Warner (1965) is given, then a randomized response model applicable to continuous data that considers a mixture of two normal distributions is considered. The target here is not to estimate any parameter, but rather to select the population with the best parameter value. This article provides a study on how to choose the best population between k distinct populations using an indifference-zone procedure. Also, this article includes tables for the required sample size needed in order to have a probability of correct selection higher than some specified value in the preference zone for the randomized response model considered.     

On selecting from k finite populations the population with the largest α -quantile

Several procedures for ranking populations according to the quantile of a given order have been discussed in the literature. These procedures deal with continuous distributions. This paper deals with the problem of selecting a population with the largest α-quantile from k ≥ 2 finite populatins, where the size of each population is known. A selection rule is given based on the sample quantiles, where he samples are drawn without replacement. A formula for the minimum probability of a correct selection for the given rule, for a certain configuration of the population α-quantiles, is given in terms of the sample numbers.     

Determination of sample size for selecting the smallest of k poisson population means

A procedure for selecting a Poisson population with smallest mean is considered using an indifference zone approach. The objective is to determine the smallest sample size n required from k ≥ 2 populations in order to attain the desired probability of correct selection. Since the means procedure is not consistent with respect to the difference or ratio alone, two distance measures are used simultaneously to overcome the difficulty in obtaining the smallest probability of correct selection that is greater than some specified limit. The constants required to determine n are computed and tabulated. The asymptotic results are derived using a normal approximation. A comparison with the exact results indicates that the proposed approximation works well. Only in the extreme cases small increases in n are observed. An example of industrial accident data is used to illustrate this procedure.     

Subset selection procedures for ΔP-superior populations

In some ranking and selection problems it is reasonable to consider any population which is inferior but sufficiently close to the best (t-th best) as acceptable. Under this assumption, this paper studies classes of procedures to meet two possible goals. A and B. Goal A is to select a subset which contains only good populations, while Goal B is of a screening nature and requires selection of a subset of size not exceeding m (1 ≤ m ≤ k) and containing at least one good population. In each case results loading to the determination of the sample size required to attain the goals above with prespecified probability are obtained. Properties of the procedures are discussed.     

Analyzing Hybrid Randomized Response Data with a Binomial Selection Procedure

The operating characteristics (OCs) of an indifference-zone ranking and selection procedure are derived for randomized response binomial data. The OCs include tables and figures to facilitate tradeoffs between sample size and a stated probability of a correct selection, i.e., correctly identifying the binomial population (out of k ≥ 2) characterized by the largest probability of success. Measures of efficiency are provided to assist the analyst in selection of an appropriate randomized response design for the collection of the data. A hybrid randomized response model, which includes the Warner model and the Greenberg et al. model, is introduced to facilitate comparisons among a wider range of statistical designs than previously available. An example comparing failure rates of contraceptive methods is used to illustrate the use of these new results.     

On selecting a subset containing the most probable multinomial event

Panchapakesan's procedure is considered for the problem of selectinga subset containing the most probable multinomial event. We use the type-2 Dirichlet integral to express the probability of a correct selection and propose a much simpler proof for the worst configuration. We also show that the supremum of the expected subset size occurs at the equal configuration.