An essentially complete class of multiple decision procedures

Let π₁,…, π_k represent k(?2) independent populations. The quality of the ith population π_i is characterized by a real-valued parameter θ_i, usually unknown. We define the best population in terms of a measure of separation between θ_i's. A selection of a subset containing the best population is called a correct selection (CS). We restrict attention to rules for which the size of the selected subset is controlled at a given point and the infimum of the probability of correct selection over the parameter space is maximized. The main theorem deals with construction of an essentially complete class of selection rules of the above type. Some classical subset selection rules are shown to belong to this class.     

Interview Costs in the Secretary Problem

The effect of interview costs on the optimal selection strategy and on the chance of success in secretary problems with order k selection rules, both for a finite number of applicants and in the limiting case, is examined. Probabilistic reasoning is used and numerical examples given.     

Sequential classification on partially ordered sets

Summary. A general theorem on the asymptotically optimal sequential selection of experiments is presented and applied to a Bayesian classification problem when the parameter space is a finite partially ordered set. The main results include establishing conditions under which the posterior probability of the true state converges to 1 almost surely and determining optimal rates of convergence. Properties of a class of experiment selection rules are explored.     

Γ-Optimal decision procedures for selecting the best population in randomized complete block design

In randomized complete block design, we face the problem of selecting the best population. If some partial information about the unknown parameters is available, then we wish to delermine the optimal decisin rule to select the best population.

In this paper, in the class of natural selection rules, we employ the Γ-optimal criterion to determine optimal decision rules that will minimize the maximum expected risk over the class of some partial information. Furthermore, the traditional hypothesis testing is briefly discussed from the view point of ranking and selecting.     

A modified least-failures sampling procedure for bernoulli subset selection

We restrict attention to a class of Bernoulli subset selection procedures which take observations one-at-a-time and can be compared directly to the Gupta-Sobel single-stage procedure. For the criterion of minimizing the expected total number of observations required to terminate experimentation, we show that optimal sampling rules within this class are not of practical interest. We thus turn to procedures which, although not optimal, exhibit desirable behavior with regard to this criterion. A procedure which employs a modification of the so-called least-failures sampling rule is proposed, and is shown to possess many desirable properties among a restricted class of Bernoulli subset selection procedures. Within this class, it is optimal for minimizing the number of observations taken from populations excluded from consideration following a subset selection experiment, and asymptotically optimal for minimizing the expected total number of observations required. In addition, it can result in substantial savings in the expected total num¬ber of observations required as compared to a single-stage procedure, thus it may be de¬sirable to a practitioner if sampling is costly or the sample size is limited.     

Isotonic rules for selecting good exponential populations

The problem of selecting exponential populations better than a control under a simple ordering prior is investigated. Based on some prior information, it is appropriate to set lower bounds for the concerned parameters. The information about the lower bounds of the concerned parameters is taken into account to derive isotonic selection rules for the control known case. An isotonic selection rule for the control unknown case is also proposed. A criterion is proposed to evaluate the performance of the selection rules. Simulation comparisons among the performances of several selection rules are carried out. The simulation results indicate that for the control known case, the new proposed selection rules perform better than some earlier existing selection rules.     

A class of simple approximate sequential tests for adaptive comparison of two treatments

We consider the problem of sequentially deciding which of two treatments is superior, A class of simple approximate sequential tests is proposed. These have the probabilities of correct selection approximately independent of the sampling rule and depending on unknown parameters only through the function of interest, such as the difference or ratio of mean responses. The tests are obtained by using a normal approximation, and this is employed to derive approximate expressions for the probabilities of correct selection and the expected sample sizes. A class of data-dependent sampling rules is proposed for minimizing any weighted average of the expected sample sizes on the two treatments, with the weights being allowed to depend on unknown parameters. The tests are studied in the particular cases of exponentially.     

Selection bias in working with the top genes in supervised classification of tissue samples

Currently there is much interest in using microarray gene-expression data to form prediction rules for the diagnosis of patient outcomes. A process of gene selection is usually carried out first to find those genes that are most useful according to some criterion for distinguishing between the given classes of tissue samples. However, there is a bias (selection bias) introduced in the estimate of the final version of a prediction rule that has been formed from a smaller subset of the genes that have been selected according to some optimality criterion. In this paper, we focus on the bias that arises when a full data set is not available in the first instance and the prediction rule is formed subsequently by working with the top-ranked genes from the full set. We demonstrate how large the subset of top genes must be before this selection bias is not of practical consequence.     

A comparison of the post selection error rate behaviour of the normal linear and quadratic discriminant rules

The normal linear discriminant rule (NLDR) and the normal quadratic discriminant rule (NQDR) are popular classifiers when working with normal populations. Several papers in the literature have been devoted to a comparison of these rules with respect to classification performance. An aspect which has, however, not received any attention is the effect of an initial variable selection step on the relative performance of these classification rules. Cross model validation variabie selection has been found to perform well in the linear case, and can be extended to the quadratic case. We report the results of a simulation study comparing the NLDR and the NQDR with respect to the post variable selection classification performance. It is of interest that the NQDR generally benefits from an initial variable selection step. We also comment briefly on the problem of estimating the post selection error rates of the two rules.     

Robust wavelet shrinkage using robust selection of thresholds

This paper considers the problem of selecting a robust threshold of wavelet shrinkage. Previous approaches reported in literature to handle the presence of outliers mainly focus on developing a robust procedure for a given threshold; this is related to solving a nontrivial optimization problem. The drawback of this approach is that the selection of a robust threshold, which is crucial for the resulting fit is ignored. This paper points out that the best fit can be achieved by a robust wavelet shrinkage with a robust threshold. We propose data-driven selection methods for a robust threshold. These approaches are based on a coupling of classical wavelet thresholding rules with pseudo data. The concept of pseudo data has influenced the implementation of the proposed methods, and provides a fast and efficient algorithm. Results from a simulation study and a real example demonstrate the promising empirical properties of the proposed approaches.     

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.     

A class of weighted normal distributions and its variants useful for inequality constrained analysis

This article develops a class of the weighted normal distributions for which the probability density function has the form of a product of a normal density and a weight function. The class constitutes marginal distributions obtained from various kinds of doubly truncated bivariate normal distributions. This class of distributions strictly includes the normal, skew–normal and two-piece skew–normal and is useful for selection modelling and inequality constrained normal mean analysis. Some distributional properties and Bayesian perspectives of the class are given. Probabilistic representation of the distributions is also given. The representation is shown to be straightforward to specify distribution and to implement computation, with output readily adapted for required analysis. Necessary theories and illustrative examples are provided.     

Population correlation matrices for sampling experiments

A procedure is given for generating correlation matrices which can be used as population correlation matrices for sampling experiments. The algorithm specifies the eigenvalues and randomly selects a correlation matrix from the class of all correlation matrices which possess these same eigenvalues. It is possible to obtain a set of correlation matrices which are indexed by the degree of interdependence among the variables by parameterizing the eigenvalues with a single parameter. An example is the case in which the eigenvalues form a geometric progression. Examples are given and an application to the problem of stopping rules in stepwise regression is discussed. Other applications are also briefly discussed.     

Robustness of ranking and selection rules using generalised g-and-k distributions

A new class of distributions, including the MacGillivray adaptation of the g-and-h distributions and a new family called the g-and-k distributions, may be used to approximate a wide class of distributions, with the advantage of effectively controlling skewness and kurtosis through independent parameters. This separation can be used to advantage in the assessment of robustness to non-normality in frequentist ranking and selection rules. We consider the rule of selecting the largest of several means with some specified confidence. In general, we find that the frequentist selection rule is only robust to small changes in the distributional shape parameters g and k and depends on the amount of flexibility we allow in the specified confidence. This flexibility is exemplified through a quality control example in which a subset of batches of electrical transformers are selected as the most efficient with a specified confidence, based on the sample mean performance level for each batch.     

Minimax subset selection for the multinomial distribution

Let (X₁,…,X_k) be a multinomial vector with unknown cell probabilities (p₁,?,p_k). A subset of the cells is to be selected in a way so that the cell associated with the smallest cell probability is included in the selected subset with a preassigned probability, P¹. Suppose the loss is measured by the size of the selected subset, S. Using linear programming techniques, selection rules can be constructed which are minimax with respect to S in the class of rules which satisfy the P¹-condition. In some situations, the rule constructed by this method is the rule proposed by Nagel (1970). Similar techniques also work for selection in terms of the largest cell probability.     

Construction and evaluation of matched quick switching systems

This paper presents a method and set of tables for the selection of equivalent basic single-sampling plans (without switching rules) and a quick switching system which includes switching rules. A better pe florming system is identifed and is compared with a sampling system which uses the switching rules ofMIL-STD-lO5D.     

Bandwidth selection procedures tor kernel density estimates

A crucial problem in kernel density estimates of a probability density function is the selection of the bandwidth. The aim of this study is to propose a procedure for selecting both fixed and variable bandwidths. The present study also addresses the question of how different variable bandwidth kernel estimators perform in comparison with each other and to the fixed type of bandwidth estimators. The appropriate algorithms for implementation of the proposed method are given along with a numerical simulation.The numerical results serve as a guide to determine which bandwidth selection method is most appropriate for a given type of estimator over a vide class of probability density functions, Also, we obtain a numerical comparison of the different types of kernel estimators under various types of bandwidths.     

Simultaneous selection and estimation in general linear models

The problem of selecting the largest treatment parameter, and simultaneously estimating the selected treatment parameter, in a general linear model is considered in the decision theoretic Bayes approach. Both cases, where the error variance is known or unknown, are included. Bayes decision rules are derived for noninformative priors and for normal priors. The problem of finding Bayes designs, i.e. designs that have minimum Bayes risk, within a given class of designs is also discussed.     

A Class of Multivariate Bilateral Selection t Distributions and Its Properties

This article proposes a class of multivariate bilateral selection t distributions useful for analyzing non-normal (skewed and/or bimodal) multivariate data. The class is associated with a bilateral selection mechanism, and it is obtained from a marginal distribution of the centrally truncated multivariate t. It is flexible enough to include the multivariate t and multivariate skew-t distributions and mathematically tractable enough to account for central truncation of a hidden t variable. The class, closed under linear transformation, marginal, and conditional operations, is studied from several aspects such as shape of the probability density function, conditioning of a distribution, scale mixtures of multivariate normal, and a probabilistic representation. The relationships among these aspects are given, and various properties of the class are also discussed. Necessary theories and two applications are provided.     

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.