An algorithm is proposed for the computation of the Mann-Whitney Test which only requires the separate ordering of the individual samples and is therefore more suitable than the usual one. It is also more suitable as t o computation time than the algorithm described by KUMMER, 1981, if the two sampl
Reliability and efficiency of algorithms for computing the significance of the Mann–Whitney test
✍ Scribed by Niranjan Nagarajan; Uri Keich
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 587 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0943-4062
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The Mann}Whitney ;-test is ubiquitous in statistical practice for the comparison of measures of location for two samples where the assumption of normality is questionable. Frequently, one has replicate data for each individual in a group and would like to compare measures of central tendency between
## Abstract NOETHER (1987) proposed a method of sample size determination for the Wilcoxon‐Mann‐Whitney test. To obtain a sample size formula, he restricted himself to alternatives that differ only slightly from the null hypothesis, so that the unknown variance o^2^ of the Mann‐Whitney statistic ca