2014
DOI: 10.1080/03610918.2013.786781
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorics and Statistical Issues Related to the Kruskal–Wallis Statistic

Abstract: We explore criteria that data must meet in order for the Kruskal-Wallis test to reject the null hypothesis by computing the number of unique ranked 1 data sets in the balanced case where each of the m alternatives has n observations. We show that the Kruskal-Wallis test tends to be conservative in rejecting the null hypothesis, and we offer a correction that improves its performance. We then compute the number of possible data sets producing unique rank-sums. The most commonly occurring data lead to an uncommo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…The Kruskal–Wallis test is applied for all three samples. What is notable, the relatively small dimension of the samples significantly simplified mathematical calculations (Bargagliotti and Greenwell 2015).…”
Section: Methodsmentioning
confidence: 99%
“…The Kruskal–Wallis test is applied for all three samples. What is notable, the relatively small dimension of the samples significantly simplified mathematical calculations (Bargagliotti and Greenwell 2015).…”
Section: Methodsmentioning
confidence: 99%
“…To address this issue, we have integrated Kruskal-Wallis test (KW) into KECA. KW is a nonparametric form of the Analysis of Variance (ANOVA) and can be used to assess whether the difference between two or more independent data groups is statistically significant [32]. The popularity of KW may be attributed to its nonnecessity of the assumptions about normal distribution.…”
Section: B Kruskal-wallis Testmentioning
confidence: 99%
“…The parameters of the GKM clustering algorithm are as follows: the crossover probability P c GKM is 0.85, the mutation probability P m GKM is 0.1, the population P GKM is 5, the maximum number of iterations TM GKM is 10, the initial value of k is 2, and the positive coefficients a and b are 2 and 1.2, respectively. In order to test the differences for statistical significance, the Kruskal-Wallis test [33] with a 5% significance level is applied for all pairwise comparisons, and the performance score [34] is adopted to rank all the algorithms: the smaller the score is, the better the algorithm is.…”
Section: A Simulationsmentioning
confidence: 99%