Closed inverse sampling procedure for selecting the largest multinomial cell probability

A class of closed inverse sampling procedures R(n,m) for selecting the multinomial cell with the largest probability is considered; here n is the maximum sample size that an experimenter can take and m is the maximum frequency that a multinomial cell can have. The proposed procedures R(n,m) achieve the same probability of a correct selection as do the corresponding fixed sample size procedures and the curtailed sequential procedures when m is at least n/2. A monotonicity property on the probability of a correct selection is proved and it is used to find the least favorable configurations and to tabulate the necessary probabilities of a correct selection and corresponding expected sample sizes     

On selecting the treatment with the largest probability of survival

Suppose there are k(>= 2) treatments and each treatment is a Bernoulli process with binomial sampling. The problem of selecting a random-sized subset which contains the treatment with the largest survival probability (reliability or probability of success) is considered. Based on the ideas from both classical approaches and general Bayesian statistical decision approach, a new subset selection procedure is proposed to solve this kind of problem in both balanced and unbalanced designs. Comparing with the classical procedures, the proposed procedure has a significantly smaller selected subset. The optimal properties and performance of it were examined. The methods of selecting and fitting the priors and the results of Monte Carlo simulations on selected important cases are also studied.     

A Two-stage minimax procedure with screening for selecting the largest normal mean

The problem of selecting the normal population with the largest population mean when the populations have a common known variance is considered. A two-stage procedure is proposed which guarantees the same probability requirement using the indifference-zone approach as does the single-stage procedure of Bechhofer (1954). The two-stage procedure has the highly desirable property that the expected total number of observations required by the procedure is always less than the total number of observations required by the corresponding single-stage procedure, regardless of the configuration of the population means. The saving in expected total number of observations can be substantial, particularly when the configuration of the population means is favorable to the experimenter. The saving is accomplished by screening out “non-contending” populations in the first stage, and concentrating sampling only on “contending” populations in the second stage.

The two-stage procedure can be regarded as a composite one which uses a screening subset-type approach (Gupta (1956), (1965)) in the first stage, and an indifference-zone approach (Bechhofer (1954)) applied to all populations retained in the selected sub-set in the second stage. Constants to implement the procedure for various k and P? are provided, as are calculations giving the saving in expected total sample size if the two-stage procedure is used in place of the corresponding single-stage procedure.     

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.     

Equal probability of correct selection for bernoulli selection procedures

The problem of selecting the Bernoulli population which has the highest "success" probability is considered. It has been noted in several articles that the probability of a correct selection is the same, uniformly in the Bernoulli p-vector (P1,P2,….,Pk), for two or more different selection procedures. We give a general theorem which explains this phenomenon.

An application of particular interest arises when "strong" curtailment of a single-stage procedure (as introduced by Bechhofer and Kulkarni (1982a) )is employed; the corresponding result for "weak" curtailment of a single-stage procedure needs no proof. The use of strong curtailment in place of weak curtailment requires no more (and usually many less) observations to achieve the same.     

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 two-stage minimax procedure with screening for selecting the largest normal mean (ii): an improved pcs lower bound and associated tables

This paper is a follow-up to an earlier article by the authors in which they proposed a two-stage procedure with screening to select the normal population with the largest population mean when the populations have a common known variance. The two-stage procedure has the highly desirable property that the expected total number of observations required by the procedure is always less than the total number of observations required by the corresponding single-stage procedure of Bechhofer (1954), regardless of the configuration of the population means. The present paper contains new results which make possible the more efficient implementation of the two-stage procedure. Tables for this purpose are given, and the improvements achieved (which are substantial) are assessed.     

Some sequential selection procedures for good regression models

In the past decade a number of fixed sampling methods have been developed for selecting the "best" or at least a "good" subset of vaiable in regression analysis. We are interested in deriving a sequential selection procedure to select a subset of a random size including equations. Tables for an example are given at the end of this paper     

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.     

An empirical bayes approach to estimating the probability of correct selection

In the problem of selecting the best of k populations, Olkin, Sobel, and Tong (1976) have introduced the idea of estimating the probability of correct selection. In an attempt to improve on their estimator we consider anempirical Bayes approach. We compare the two estimators via analytic results and a simulation study.     

Strategies for a sequential selection of the better of two trinomial populations

A sequential procedure for a selection of the better of two trinomial populations has been proposed by ?idók (1988). The present paper shows some Monte Carlo results for 4 different strategies of sequential experimentation in this procedure, on this basis compares the strategies, and gives some practical recommendations for choosing the strategy.     

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.     

On Calculations Involving the Maximum Cell Frequency

We describe a method of computing the cumulative distribution function of the maximum and minimum cell frequencies in sampling distributions commonly encountered in the analysis of categorical data.The procedure is efficient for exact or approximate calculation in both homogeneous and non-homogeneous cases, is non-recursive, and does not require Dirichlet integrals.Some related statistical problems are also discussed.     

A sequential design for maximizing the probability of a favourable response

Consider the situation in which subjects arrive sequentially for a treatment and in which there are two distinct ways in which the treatment may fail. Treatments are given at different dosages, and the probabilities of the two failure types vary with dose. Assuming that decreasing the chances of one failure type increases the chances of the other, we say the failures oppose each other. Also assume that one failure type is primary in that, if it occurs, it censors the trial, so that observation of the secondary failure type is contingent on no failure of the primary type. We are interested in designs that provide information about the dose that maximizes the probability of success, i.e., the optimal dose, while treating very few subjects at dosages that have high risks of failure. Assuming that dosages belong to a discrete set, we show that a randomized version of the Pólya urn scheme causes dose selection to be progressively biased so as to favour those doses that produce success with higher probability.     

Maximum-likelihood estimation of the random-clumped multinomial model as a prototype problem for large-scale statistical computing

Numerical methods are needed to obtain maximum-likelihood estimates (MLEs) in many problems. Computation time can be an issue for some likelihoods even with modern computing power. We consider one such problem where the assumed model is a random-clumped multinomial distribution. We compute MLEs for this model in parallel using the Toolkit for Advanced Optimization software library. The computations are performed on a distributed-memory cluster with low latency interconnect. We demonstrate that for larger problems, scaling the number of processes improves wall clock time significantly. An illustrative example shows how parallel MLE computation can be useful in a large data analysis. Our experience with a direct numerical approach indicates that more substantial gains may be obtained by making use of the specific structure of the random-clumped model.     

On the UMVU estimator for the generalized variance of the multinomial family

Abstract

The generalized variance is an important statistical indicator which appears in a number of statistical topics. It is a successful measure for multivariate data concentration. In this article, we established, in a closed form, the bias of the generalized variance maximum likelihood estimator of the Multinomial family. We also derived, with a complete proof, the uniformly minimum variance unbiased estimator (UMVU) for the generalized variance of this family. These results rely on explicit calculations, the completeness of the exponential family and the Lehmann–Scheffé theorem.