General scores statistics on ranks in the analysis of unbalanced designs

The authors consider the situation of incomplete rankings in which n judges independently rank k_i ∈ {2, …, t} objects. They wish to test the null hypothesis that each judge picks the ranking at random from the space of k_i! permutations of the integers 1, …, k_i. The statistic considered is a generalization of the Friedman test in which the ranks assigned by each judge are replaced by real‐valued functions a(j, k_i), 1 ≤ j ≤ k_i ≤ t of the ranks. The authors define a measure of pairwise similarity between complete rankings based on such functions, and use averages of such similarities to construct measures of the level of concordance of the judges' rankings. In the complete ranking case, the resulting statistics coincide with those defined by Hájek & ?idák (1967, p. 118), and Sen (1968). These measures of similarity are extended to the situation of incomplete rankings. A statistic is derived in this more general situation and its properties are investigated.     

A mutual information-based k-sample test for discrete distributions

The two-sample problem and its extension to the k-sample problem are well known in the statistical literature. However, the discrete version of the k-sample problem is relatively less explored. Here in this work we suggest a k-sample non-parametric test procedure for discrete distributions based on mutual information. A detailed power study with comparison with other alternatives is provided. Finally, a comparison of some English soccer league teams based on their goal-scoring pattern is discussed.     

Testing multiple slippages

A class of invariant Bayes rules is derived for testing homogeneity of k (≥2) different populations against (^k_t) slippage alternatives that some (unknown) subset of size t of the given populations has parameter larger than the remaining k-t, where t is a given integer between 1 and k-1. For a similar problem in nonparametric situations, locally best tests based on ranks are derived.     

Sign test based on k-tuple general ranked set samples

ABSTRACT

The sign test based on the k-tuple ranked set samples is discussed here. We first derive the distribution of the k-tuple ranked set sample sign test statistic, and then the asymptotic distribution is also obtained. We then compare its performance with its counterparts based on simple random sample and classical ranked set sample. The asymptotic relative efficiency and the power are then derived. Finally, the effect of imperfect ranking on the procedure is assessed.     

A power study of k-linear-r-ahead recursive residuals test for change-point in finite sequences

A change-point problem in finite sequences is considered along with, so-called, k-linear-r-ahead recursive residuals and a test procedure proposed by ?o?a¸d? et al. [?o?a¸d?, J.A., Szkutnik, Z., Majerczak, J. and Duda, K. 1998, Detection of change point in oxygen uptake during an incremental exercise test using recursive residuals: relationship to the plasma lactate accumulation and blood acid base balance. European Journal of Applied Physiology, 78, 369–377.]. Theoretical significance levels of that (conservative) test are compared with its simulated sizes. Numerical approximations to the powers against various alternatives are given. Properties of the k-linear-r-ahead recursive residuals are described and the consistency of the test is proved, when the noise level goes to zero.     

Use of the squared ranks test to test for the equality of the coefficients of variation

A distribution-free test for the equality of the coefficients of variation from k populations is obtained by using the squared ranks test for variances, as presented by Conover and Iman (1978) and Conover (1980), on the original observations divided by their respective expected values. Substitution of the sample mean in place of the expected value results in the test being only asymptotically distribution-free. Results of a simulation study evaluating the size of the test for various coefficient of variation values and probability distributions are presented.     

Detection of concordance for extreme ranks

When analysing ranking data from one or more groups of judges one may wish to allow for the possibility that the judges have paid more attention to the allocation of the extreme ranks, rather than to the intermediate ranks. In some cases they may have only worried about assigning the top ranks (1 and 2, say) while randomly allocating the remaining ones.

In another context, the analystmay wish to only take account of the agreement among judges with respect to extreme ranks (top or bottom, or both),

In such situations an analysis of concordance within, and between groups, if appropriate, should be able to deal with extreme ranks specifically. We propose a data analyticapproach, related to an analysis of diversity,which actyally permits an analysis of concordance for each rank separately.     

Precedence tests and Lehmann alternatives

G = F ^k (k > 1); G = 1 − (1−F) ^k (k < 1); G = F ^k (k < 1); and G = 1 − (1−F) ^k (k > 1), where F and G are two continuous cumulative distribution functions. If an optimal precedence test (one with the maximal power) is determined for one of these four classes, the optimal tests for the other classes of alternatives can be derived. Application of this is given using the results of Lin and Sukhatme (1992) who derived the best precedence test for testing the null hypothesis that the lifetimes of two types of items on test have the same distibution. The test has maximum power for fixed κ in the class of alternatives G = 1 − (1−F) ^k , with k < 1. Best precedence tests for the other three classes of Lehmann-type alternatives are derived using their results. Finally, a comparison of precedence tests with Wilcoxon's two-sample test is presented. Received: February 22, 1999; revised version: June 7, 2000     

The Likelihood Ratio Test with the Box–Cox Transformation for the Normal Mixture Problem: Power and Sample Size Study

Abstract

Through simulation and regression, we study the alternative distribution of the likelihood ratio test in which the null hypothesis postulates that the data are from a normal distribution after a restricted Box–Cox transformation and the alternative hypothesis postulates that they are from a mixture of two normals after a restricted (possibly different) Box–Cox transformation. The number of observations in the sample is called N. The standardized distance between components (after transformation) is D = (μ₂ ? μ₁)/σ, where μ₁ and μ₂ are the component means and σ² is their common variance. One component contains the fraction π of observed, and the other 1 ? π. The simulation results demonstrate a dependence of power on the mixing proportion, with power decreasing as the mixing proportion differs from 0.5. The alternative distribution appears to be a non-central chi-squared with approximately 2.48 + 10N ^?0.75 degrees of freedom and non-centrality parameter 0.174N(D ? 1.4)² × [π(1 ? π)]. At least 900 observations are needed to have power 95% for a 5% test when D = 2. For fixed values of D, power, and significance level, substantially more observations are necessary when π ≥ 0.90 or π ≤ 0.10. We give the estimated powers for the alternatives studied and a table of sample sizes needed for 50%, 80%, 90%, and 95% power.     

An extension of the Anderson–Darling k-sample test to arbitrary sample space partition sizes

In this paper we first show that the k-sample Anderson–Darling test is basically an average of Pearson statistics in 2?×?k contingency tables that are induced by observation-based partitions of the sample space. As an extension, we construct a family of rank test statistics, indexed by c?∈??, which is based on similarly constructed c?×?k partitions. An extensive simulation study, in which we compare the new test with others, suggests that generally very high powers are obtained with the new tests. Finally we propose a decomposition of the test statistic in interpretable components.     

A simulation study on the influence of ties on uniform scores test for circular data

Uniform scores test is a rank-based method that tests the homogeneity of k-populations in circular data problems. The influence of ties on the uniform scores test has been emphasized by several authors in several articles and books. Moreover, it is suggested that the uniform scores test should be used with caution if ties are present in the data. This paper investigates the influence of ties on the uniform scores test by computing the power of the test using average, randomization, permutation, minimum, and maximum methods to break ties. Monte Carlo simulation is performed to compute the power of the test under several scenarios such as having 5% or 10% of ties and tie group structures in the data. The simulation study shows no significant difference among the methods under the existence of ties but the test loses its power when there are many ties or complicated group structures. Thus, randomization or average methods are equally powerful to break ties when applying uniform scores test. Also, it can be concluded that k-sample uniform scores test can be used safely without sacrificing the power if there are only less than 5% of ties or at most two groups of a few ties.     

A permutation test approach to the choice of size k for the nearest neighbors classifier

The k nearest neighbors (k-NN) classifier is one of the most popular methods for statistical pattern recognition and machine learning. In practice, the size k, the number of neighbors used for classification, is usually arbitrarily set to one or some other small numbers, or based on the cross-validation procedure. In this study, we propose a novel alternative approach to decide the size k. Based on a k-NN-based multivariate multi-sample test, we assign each k a permutation test based Z-score. The number of NN is set to the k with the highest Z-score. This approach is computationally efficient since we have derived the formulas for the mean and variance of the test statistic under permutation distribution for multiple sample groups. Several simulation and real-world data sets are analyzed to investigate the performance of our approach. The usefulness of our approach is demonstrated through the evaluation of prediction accuracies using Z-score as a criterion to select the size k. We also compare our approach to the widely used cross-validation approaches. The results show that the size k selected by our approach yields high prediction accuracies when informative features are used for classification, whereas the cross-validation approach may fail in some cases.     

A new distribution-free k-sample test: Analysis of kernel density functionals

A novel distribution-free k-sample test of differences in location shifts based on the analysis of kernel density functional estimation is introduced and studied. The proposed test parallels one-way analysis of variance and the Kruskal–Wallis (KW) test aiming at testing locations of unknown distributions. In contrast to the rank (score)-transformed non-parametric approach, such as the KW test, the proposed F-test uses the measurement responses along with well-known kernel density estimation (KDE) to estimate the locations and construct the test statistic. A practical optimal bandwidth selection procedure is also provided. Our simulation studies and real data example indicate that the proposed analysis of kernel density functional estimate (ANDFE) test is superior to existing competitors for fat-tailed or heavy-tailed distributions when the k groups differ mainly in location rather than shape, especially with unbalanced data. ANDFE is also highly recommended when it is unclear whether test groups differ mainly in shape or location. The Canadian Journal of Statistics 48: 167–186; 2020 © 2019 Statistical Society of Canada     

Paradoxes in nonparametric tests

This paper is a continuation of one (1992) in which the author studied the paradoxes that can arise when a nonparametric statistical test is used to give an ordering of k samples and the subsets of those samples. This article characterizes the projection paradoxes that can occur when using contingency tables, complete block designs, and tests of dichotomous behaviour of several samples. This is done by examining the “dictionaries” of possible orderings of each of these procedures. Specifically, it is shown that contingency tables and complete block designs, like the Kruskal-Wallis nonparametric test on k samples, minimize the number and kinds of projection paradoxes that can occur; however, using a test of dichotomous behaviour of several samples does not. An analysis is given of two procedures used to determine the ordering of a pair of samples from a set of k samples. It is shown that these two procedures may not have anything in common.     

A generalized step-up-down multiple test procedure

A generalization of step-up and step-down multiple test procedures is proposed. This step-up-down procedure is useful when the objective is to reject a specified minimum number, q, out of a family of k hypotheses. If this basic objective is met at the first step, then it proceeds in a step-down manner to see if more than q hypotheses can be rejected. Otherwise it proceeds in a step-up manner to see if some number less than q hypotheses can be rejected. The usual step-down procedure is the special case where q = 1, and the usual step-up procedure is the special case where q = k. Analytical and numerical comparisons between the powers of the step-up-down procedures with different choices of q are made to see how these powers depend on the actual number of false hypotheses. Examples of application include comparing the efficacy of a treatment to a control for multiple endpoints and testing the sensitivity of a clinical trial for comparing the efficacy of a new treatment with a set of standard treatments.     

A moment test to identify uniformity

An omnibus test of uniformity based upon the ratios of sample moments and population moments is introduced. Results of a monte carlo power study show that for two types of alternatives considered, the proposed test has good power in comparison with Neyman's test N ₂Greenwood's test, Kolmogorov-Smirnov test, and Chi-squared test.     

A general algorithm for computing simultaneous prediction intervals for the (log)-location-scale family of distributions

Making predictions of future realized values of random variables based on currently available data is a frequent task in statistical applications. In some applications, the interest is to obtain a two-sided simultaneous prediction interval (SPI) to contain at least k out of m future observations with a certain confidence level based on n previous observations from the same distribution. A closely related problem is to obtain a one-sided upper (or lower) simultaneous prediction bound (SPB) to exceed (or be exceeded) by at least k out of m future observations. In this paper, we provide a general approach for computing SPIs and SPBs based on data from a particular member of the (log)-location-scale family of distributions with complete or right censored data. The proposed simulation-based procedure can provide exact coverage probability for complete and Type II censored data. For Type I censored data, our simulation results show that our procedure provides satisfactory results in small samples. We use three applications to illustrate the proposed simultaneous prediction intervals and bounds.     

Implications of random cut‐points theory for the Mann‐Whitney and binomial tests

Through random cut‐points theory, the author extends inference for ordered categorical data to the unspecified continuum underlying the ordered categories. He shows that a random cut‐point Mann‐Whitney test yields slightly smaller p‐values than the conventional test for most data. However, when at least P% of the data lie in one of the k categories (with P = 80 for k = 2, P = 67 for k = 3,…, P = 18 for k = 30), he also shows that the conventional test can yield much smaller p‐values, and hence misleadingly liberal inference for the underlying continuum. The author derives formulas for exact tests; for k = 2, the Mann‐Whitney test is but a binomial test.     

On grouping sets of exponential populations

Suppose we have k random samples each of size n from a two parameter exponential distribution with location parameters μ _i i=1,…,k, and where each item has the same, unknown scale parameter. A multistage procedure is developed to determine t≦k groups such that in any one group the distributions have μ_i's that are not appreciably different. The method yields a unique grouping and extends the approach of the Kumar and Pate1 test.The emphasis is on the development of a procedure based on the null sampling distribution of the maximum gap of the ordered first order statistics from exponential distributions. The procedure is based on complete ordered samples or censored (of any or of all) samples.