A Comparison of Algorithms for the Computation of the Mann-Whitney Test
β Scribed by Dr. rer. nat. E. Schuster
- Publisher
- John Wiley and Sons
- Year
- 1985
- Tongue
- English
- Weight
- 242 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0323-3847
No coin nor oath required. For personal study only.
β¦ Synopsis
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 sample sizes are of the same magnitude.
π 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
As part of international e4orts to evaluate alternative reaction-to-5re tests, several series of room/corner tests have been conducted. Materials tested were mostly di4erent wood products but included gypsum board and a few foam plastics. This is a review of the overall results of related studies in
In this paper, we propose a new approach for computing 2D FFT's that are suitable for implementation on a systolic array architecture. Our algorithm is derived in this paper from a Cooley decimation-in-time algorithm by using an appropriate indexing process. It is proved that the number of multiplic