A two stage procedure for selecting δ∗-optimal means in the normal model

Suppose π₁,…,π_k are k normal populations with π_i having unknown mean μ_i and unknown variance σ². The population π_i will be called δ^?-optimal (or good) if μ_i is within a specified amountδ? of the largest mean. A two stage procedure is proposed which selects a subset of the k populations and guarantees with probability at least P^? that the selected subset contains only δ?-optimal π_i ’s. In addition to screening out non-good populations the rule guarantees a high proportion of sufficiently good π_i’S will be selected.     

A class of fixed-width confidence intervals for a ranked normal mean

Suppose that we are given k(≥ 2) independent and normally distributed populations π₁, …, π_k where π_i has unknown mean μ_i and unknown variance σ² _i (i = 1, …, k). Let μ_[i] (i = 1, …, k) denote the i^th smallest one of μ₁, …, μ_k. A two-stage procedure is used to construct lower and upper confidence intervals for μ_[i] and then use these to obtain a class of two-sided confidence intervals on μ_[i] with fixed width. For i = k, the interval given by Chen and Dudewicz (1976) is a special case. Comparison is made between the class of two-sided intervals and a symmetric interval proposed by Chen and Dudewicz (1976) for the largest mean, and it is found that for large values of k at least one of the former intervals requires a smaller total sample size. The tables needed to actually apply the procedure are provided.     

Confidence intervals for the largest mean from k correlated normal populations

Let X= (X₁,…, X_k)’ be a k-variate (k ≥ 2) normal random vector with unknown population mean vector μ = (μ₁ ,…, μ_k)’ and covariance matrix Σ of order k and let μ_[1] ≤ … ≤ μ_[k] be the ordered values of the μ ’ s. No prior knowledge of the pairing of the μ_[i] with the X_j. (or μ_[i] with the σ_j ²) is assumed for any i and j (1 ≤ i, j ≤ k). Based on a random sample of N independent vector observations on X, this paper considers both upper and lower (one-sided) and two-sided 100γ% (0 < γ < 1) confidence intervals for μ_[k] and μ_[1], the largest and the smallest mean, respectively, when Σ is known and when Σ is equal to σ²R with common unknown variance σ² > 0 and correlation matrix R known, respectively. An optimum two-sided confidence interval via finding the shortest length from this class is also considered. Necessary tables and computer program to actually apply these procedures are provided.     

A Restricted Subset Selection Rule for Selecting at Least One of the t Best Normal Populations in Terms of Their Means When Their Common Variance is Known,Case II

Consider k( ? 2) normal populations with unknown means μ₁, …, μ_k, and a common known variance σ². Let μ_[1] ? ??? ? μ_[k] denote the ordered μ_i.The populations associated with the t(1 ? t ? k ? 1) largest means are called the t best populations. Hsu and Panchapakesan (2004) proposed and investigated a procedure R_HPfor selecting a non empty subset of the k populations whose size is at most m(1 ? m ? k ? t) so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whenever μ_{[k ? t + 1]} ? μ_{[k ? t]} ? δ*, where P*?and?δ* are specified in advance of the experiment. This probability requirement is known as the indifference-zone probability requirement. In the present article, we investigate the same procedure R_HP for the same goal as before but when k ? t < m ? k ? 1 so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whatever be the configuration of the unknown μ_i. The probability requirement in this latter case is termed the subset selection probability requirement. Santner (1976) proposed and investigated a different procedure (R_S) based on samples of size n from each of the populations, considering both cases, 1 ? m ? k ? t and k ? t < m ? k. The special case of t = 1 was earlier studied by Gupta and Santner (1973) and Hsu and Panchapakesan (2002) for their respective procedures.     

ON TESTING AGAINST RESTRICTED ALTERNATIVES FOR THE VARIANCES OF GAUSSIAN MODELS

Let π₁,…,π_p be p independent normal populations with means μ₁…, μ_p and variances σ²₁,…, σ²_p respectively. Let X(n_i) be a simple random sample of size n_i from π_i, i = 1,…,p. Given the simple random samples X(n₁),…, X(n_p) from π₁,…,π_p respectively, a test has been proposed for testing the homogeneity of variances H₀: σ²₁=…σ²_p, against the restricted alternative, H₁: σ²₁≥…≥σ²_p, with at least one strict inequality. Some properties of the test are discussed and critical values are tabulated.     

A Subset Selection Procedure for Selecting the Exponential Population Having the Longest Mean Lifetime When the Guarantee Times are the Same

ABSTRACT

Consider k(≥ 2) independent exponential populations Π₁, Π₂, …, Π _k , having the common unknown location parameter μ ∈ (?∞, ∞) (also called the guarantee time) and unknown scale parameters σ₁, σ₂, …σ _k , respectively (also called the remaining mean lifetimes after the completion of guarantee times), σ _i  > 0, i = 1, 2, …, k. Assume that the correct ordering between σ₁, σ₂, …, σ _k is not known apriori and let σ_[i], i = 1, 2, …, k, denote the ith smallest of σ _j s, so that σ_[1] ≤ σ_[2] ··· ≤ σ_[k]. Then Θ _i  = μ + σ _i is the mean lifetime of Π _i , i = 1, 2, …, k. Let Θ_[1] ≤ Θ_[2] ··· ≤ Θ_[k] denote the ranked values of the Θ _j s, so that Θ_[i] = μ + σ_[i], i = 1, 2, …, k, and let Π_(i) denote the unknown population associated with the ith smallest mean lifetime Θ_[i] = μ + σ_[i], i = 1, 2, …, k. Based on independent random samples from the k populations, we propose a selection procedure for the goal of selecting the population having the longest mean lifetime Θ_[k] (called the “best” population), under the subset selection formulation. Tables for the implementation of the proposed selection procedure are provided. It is established that the proposed subset selection procedure is monotone for a general k (≥ 2). For k = 2, we consider the loss measured by the size of the selected subset and establish that the proposed subset selection procedure is minimax among selection procedures that satisfy a certain probability requirement (called the P*-condition) for the inclusion of the best population in the selected subset.     

Selecting the normal population with the smallest variance: A restricted subset selection rule

Consider k( ? 2) normal populations whose means are all known or unknown and whose variances are unknown. Let σ²_[1] ? ??? ? σ_[k]² denote the ordered variances. Our goal is to select a non empty subset of the k populations whose size is at most m(1 ? m ? k ? 1) so that the population associated with the smallest variance (called the best population) is included in the selected subset with a guaranteed minimum probability P* whenever σ²_[2]/σ_[1]² ? δ* > 1, where P* and δ* are specified in advance of the experiment. Based on samples of size n from each of the populations, we propose and investigate a procedure called R_BCP. We also derive some asymptotic results for our procedure. Some comparisons with an earlier available procedure are presented in terms of the average subset sizes for selected slippage configurations based on simulations. The results are illustrated by an example.     

Some subset selection problems

Consider that we have a collection of k populations π₁, π₂…,π_k. The quality of the ith population is characterized by a real parameter θ_i and the population is to be designated as superior or inferior depending on how much the θ_i differs from θ_max = max{θ₁, θ₂,…,θ_k}. From the set {π₁, π₂,…,π_k}, we wish to select the subset of superior populations. In this paper we devise rules of selection which have the property that their selected set excludes all the inferior populations with probability at least 1?α, where a is a specified number.     

Minimax type procedures for nonparametric selection of the “best” population with partially classified data

Consider a sequence x ≡ (x₁,…, x_n) of n independent observations, in which each observation x_i is known to be a realization from either one of k_i given populations, chosen among k (≥ k_i) populations π₁, …, π_k Our main objective is to study the problem of the selection of the most reliable population π_j at a fixed time ξ, when no assumptions about the k populations are made. Some numerical examples are presented.     

Simultaneous selection of extreme populations:a bayesian approach

The problem of simultaneously selecting two non-empty subsets, S_Land S_U, of k populations which contain the lower extreme population (LEP) and the upper extreme population (UEP), respectively, is considered. Unknown parameters θ₁,…,θ_kcharacterize the populations π₁,…,π_kand the populations associated with θ_[1]=min θ_i. and θ_[k]= max θ_i. are called the LEP and the UEP, respectively. It is assumed that the underlying distributions possess the monotone likelihood ratio property and that the prior distribution of θ= (θ₁,…,θ_k) is exchangeable. The Bayes rule with respect to a general loss function is obtained. Bayes rule with respect to a semi-additive and non-negative loss function is also determined and it is shown that it is minimax and admissible. When the selected subsets are required to be disjoint, it shown that the Bayes rule with respect to a specific loss function can be obtained by comparing certain computable integrals, Application to normal distributions with unknown means θ₁,…,θ_kand a common known variance is also considered.     

Estimation of the location parameter and the average worth of the selected subset of two parameter exponential populations under LINEX loss function

Suppose a subset of populations is selected from k exponential populations with unknown location parameters θ₁, θ₂, …, θ_k and common known scale parameter σ. We consider the estimation of the location parameter of the selected population and the average worth of the selected subset under an asymmetric LINEX loss function. We show that the natural estimator of these parameters is biased and find the uniformly minimum risk-unbiased (UMRU) estimator of these parameters. In the case of k = 2, we find the minimax estimator of the location parameter of the smallest selected population. Furthermore, we compare numerically the risk of UMRU, minimax, and the natural estimators.     

Some locally optimal subset selection rules for comparison with a control

Let π₀,π₁,…,π_k be k+1 independent populations. For i=0,1,…,k,π_i has the densit f(x,θ_i), where the (unknown) parameter θ_i belongs to an interval of the real line. Our goal is to select from π₁,… π_k (experimental treatments) those populations, if any, that are better (suitably defined) than π₀ which is the control population. A locally optimal rule is derived in the class of rules for which Pr(π_i is selected)γ_i, i=1,…,k, when θ₀=θ₁=?=θ_k. The criterion used for local optimality amounts to maximizing the efficiency in a certain sense of the rule in picking out the superior populations for specific configurations of θ=(θ₀,…,θ_k) in a neighborhood of an equiparameter configuration. The general result is then applied to the following special cases: (a) normal means comparison — common known variance, (b) normal means comparison — common unknown variance, (c) gamma scale parameters comparison — known (unequal) shape parameters, and (d) comparison of regression slopes. In all these cases, the rule is obtained based on samples of unequal sizes.     

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.     

Small samples confidencce intervals on common mean of two normal distributions variances

Let X₁,X₂,…,X_m be distributed normally with mean μ and variance σ² _X; Let Y₁,Y₂,…,Y_n be distributed normally with mean μ and variance σ² _Y; let X₁,X₂,…,X_m,Y₁,Y₂,…,Y_n be jointly independent. There have been several papers written concerning point estimation of μ for this problem, but very little is available in the literature concerning confidence intervals on the common mean μ. In this paper a method is proposed that results in a confidence interval with confidence coefficient essentially equal to a prescribed value 1 - α. The method is evaluated and compnred with other methods through the expected length of the confidence interval.     

Estimating Average Worth of the Selected Subset from Two-Parameter Exponential Populations

ABSTRACT

Suppose independent random samples are available from k(k ≥ 2) exponential populations ∏₁,…,∏ _k with a common location θ and scale parameters σ₁,…,σ _k , respectively. Let X _i and Y _i denote the minimum and the mean, respectively, of the ith sample, and further let X = min{X ₁,…, X _k } and T _i  = Y _i  ? X; i = 1,…, k. For selecting a nonempty subset of {∏₁,…,∏ _k } containing the best population (the one associated with max{σ₁,…,σ _k }), we use the decision rule which selects ∏ _i if T _i  ≥ c max{T ₁,…,T _k }, i = 1,…, k. Here 0 < c ≤ 1 is chosen so that the probability of including the best population in the selected subset is at least P* (1/k ≤ P* < 1), a pre-assigned level. The problem is to estimate the average worth W of the selected subset, the arithmetic average of means of selected populations. In this article, we derive the uniformly minimum variance unbiased estimator (UMVUE) of W. The bias and risk function of the UMVUE are compared numerically with those of analogs of the best affine equivariant estimator (BAEE) and the maximum likelihood estimator (MLE).     

Tests for the umbrella alternative under normality

Consider a one-way layout of the analysis of variance assuming independence, normality, and homogeneity of variance. Test the null hypothesis H_o that the means, j., of each of Amp; columns, i = 1,…, k are equal versus the alternative that they follow an umbrella pattern. That is, the alternative is H₁-H₀ where H₁: μ₁> μ₂>… > μk, and m is known. We derive a class of tests which are unbiased and lie in a nontrivial complete class. We recommend specific tests within the class. A simulation of the power functions of some tests is contrasted with the simulated power function of the likelihood ratio test.     

Complete ranking procedures with quadratic loss

Suppose that one wishes to rank k normal populations, each with common variance σ² and unknown means θ_i (i=1,2,…,k). Independent samples of size n are taken from each population, and the sample averages are used to rank the populations. In this paper, we investigate what sample sizes, n, are necessary to attain “good” rankings under various loss functions. Section discusses various loss functions and their interpretation. Section 2 gives the solution for a reasonable non-parametric loss function. Section 3 gives the solution for a reasonable parameteric loss function.     

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.