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     

Selection from uniform populations based on sample mtdranges and an associated estimation after selection

Selection of the uniform population having the largest location parameter (point of symmetry) is considered using both the indifference zone and subset selection formulations. For the indifference zone rule selecting one of the population as the best, estimation of the parameter of the selected population is considered in the case of two given populations.     

Selection and ranking procedures: a brief introduction

This paper presents a brief introduction to selection and ranking methodology. Both indifference zone and subset selection approaches are discussed along with some modifications and generalizations. Two examples are provided to illustate the use of subset selection and the indifference zone approaches. The paper concludes with the remark that selection and ranking methodology is a realistic approach in statistical analyses involving comparisons among two or more treatments.     

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.     

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

     

Multiple decision rules for comparing several populations with a fixed known standard

Independent observations are available from k univariate distributions indexed by a real parameter θ. It is desired to select that distribution with the largest parameter value unless this value is smaller than some fixed standard θ₀ in which case no distribution is to be selected. Various single-stage procedures for this (k+l)-decision problem are discussed, using indifference zone, decision theoretic, Bayesian, and subset selection approaches.     

New procedures for selecting the k-best exponential populations

Suppose exponential populations π_i with parameters (μ_i,σ_i) (i = 1, 2, …, K) are given. The σ_i can be unknown and unequal. This article discusses how to select the k (≥1) best populations. Under the subset selection formulation, a one-stage procedure is proposed. Under the indifference zone formulation, a two-stage procedure is proposed. An appealing feature of these procedures is that no statistical tables are needed for their implementation.     

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.     

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.     

On some optimal selection procedures for weibull populations

Consider k (k >(>)2) Weibull populations. We shall derive a method of constructing optimal selection procedures to select a subset of the k populations containing the best population which control the size of the selected subset and which maximises the minimum probability of making a correct selection. Procedures and results are derived for the case when sample sizes are unequal. Some tables and figures are given at the end of this paper.     

Sequential selectiok procedures based on confidence sequences for normal populations

In this paper confidence sequences are used to construct sequential procedures for selecting the population with the a common variance. These procedures are shown to provide substantial saving, particularly in the expected samplw sizes of the inferior populations,over various procedures in the literature. A new “indifference zone” formulation is given for the correct selection probability requirement, and confidence sequences are also applied to construct sequential procedures for this new selection goal.     

Selecting logistic populations using the sample medians

This paper is concerned primarily with subset selection procedures based on the sample mediansof logistic populations. A procedure is given which chooses a nonempty subset from among kindependent logistic populations, having a common known variance, so that the populations with thelargest location parameter is contained in the subset with a pre‐specified probability. Theconstants required to apply the median procedure with small sample sizes (≤= 19) are tabulated and can also be used to construct simultaneous confidence intervals. Asymptotic formulae are provided for application with larger sample sizes. It is shown that, under certain situations, rules based on the median are substantially more efficient than analogous procedures based either on sample means or on the sum of joint ranks.     

Variable selection in linear regression based on ridge estimator

In this article, we consider the problem of variable selection in linear regression when multicollinearity is present in the data. It is well known that in the presence of multicollinearity, performance of least square (LS) estimator of regression parameters is not satisfactory. Consequently, subset selection methods, such as Mallow's Cp, which are based on LS estimates lead to selection of inadequate subsets. To overcome the problem of multicollinearity in subset selection, a new subset selection algorithm based on the ridge estimator is proposed. It is shown that the new algorithm is a better alternative to Mallow's Cp when the data exhibit multicollinearity.     

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.     

Selection and Ranking Procedures for Type I Extreme Value Populations and a Related Homogeneity Test

Consider k (≥2) independent Type I extreme value populations with unknown location parameters and common known scale parameter. With samples of same size, we study procedures based on the sample means for (1) selecting the population having the largest location parameter, (2) selecting the population having the smallest location parameter, and (3) testing for equality of all the location parameters. We use Bechhofer's indifference-zone and Gupta's subset selection formulations. Tables of constants for implemention are provided based on approximation for the distribution of the standardized sample mean by a generalized Tukey's lambda distribution. Examples are provided for all procedures.     

Distribution-free subset selection for incompletely ranked data

In market research and some other areas, it is common that a sample of n judges (consumers, evaluators, etc.) are asked to independently rank a series of k objects or candidates. It is usually difficult to obtain the judges' full cooperation to completely rank all k objects. A practical way to overcome this difficulty is to give each judge the freedom to choose the number of top candidates he is willing to rank. A frequently encountered question in this type of survey is how to select the best object or candidate from the incompletely ranked data. This paper proposes a subset selection procedure which constructs a random subset of all the k objects involved in the survey such that the best object is included in the subset with a prespecified confidence. It is shown that the proposed subset selection procedure is distribution-free over a very broad class of underlying distributions. An example from a market research study is used to illustrate the proposed procedure.     

Subset selection of the t best populations

Selection of the “best” t out of k populations has been considered in the indifferece zone formulation by Bachhofer (1954) and in the subset selection formulation by Carroll, Gupta and Huang (1975). The latter approach is used here to obtain conservative solutions for the goals of selecting (i) all the “good” or (ii) only “good” populations, where “good” means having a location parameter among the largest t. For the case of normal distributions, with common unknown variance, tables are produced for implementing these procedures. Also, for this case, simulation results suggest that the procedure may not be too conservative.     

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.     

On rules based on sample medians for selection of the largest location parameter

The problem of selection of a subset containing the largest of several location parameters is considered, and a Gupta-type selection rule based on sample medians is investigated for normal and double exponential populations. Numerical comparisons between rules based on medians and means of small samples are made for normal and contaminated normal populations, assuming the popula-tion means to be equally spaced. It appears that the rule based on sample means loses its superiority over the rule based on sample medians in case the samples are heavily contaminated. The asymptotic relative efficiency (ARE) of the medians procedure relative to the means procedure is also computed, assuming the normal means to be in a slippage configuration. The means proce-dure is found to be superior to the median procedure in the sense of ARE. As in the small sample case, the situation is reversed if the normal populations are highly contaminate.     

Confidence bounds and selection of the t best populations

Confidence statements about location (or scale) parameters associated with K populations, which may be used in making selection decisions about those populations, are investigated. When a subset of fixed size t is selected from the K populations a lower bound is obtained for the minimum selected parameter as a function of the maximum non-selected parameter. Tables are produced for the normal means case when the variance is common but unknown. It is pointed out that these tables may be used to find confidence intervals discussed by Hsu (1984