Reliability and efficiency of algorithms for computing the significance of the Mann-Whitney test
From MaRDI portal
(Redirected from Publication:638042)
Recommendations
- A Comparison of Algorithms for the Computation of the Mann-Whitney Test
- Two permutation tests and the Mann-Whitney test: a robustness study
- Implications of random cut-points theory for the Mann-Whitney and binomial tests
- Some Modifications on the Application of the Exact Wilcoxon–Mann–Whitney Test
- Combinatorics, computer algebra and the Wilcoxon-Mann-Whitney test
- Mann-Whitney test with empirical likelihood methods for pretest-posttest studies
Cites work
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 1971052 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- A Uniform Saddlepoint Expansion for the Null-Distribution of the Wilcoxon-Mann-Whitney Statistic
- An Approximation to the Wilcoxon-Mann-Whitney Distribution
- An Efficient, Minimal-Storage Procedure for Calculating the Mann-Whitney U, Generalized U and Similar Distributions
- Combinatorics, computer algebra and the Wilcoxon-Mann-Whitney test
- Exact Significance Testing to Establish Treatment Equivalence with Ordered Categorical Data
- On Obtaining Permutation Distributions in Polynomial Time
- On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
- Saddlepoint approximation near the endpoints of the support
- Saddlepoint approximations of the two-sample Wilcoxon statistic
- Significance Probabilities of the Wilcoxon Test
Cited in
(2)
This page was built for publication: Reliability and efficiency of algorithms for computing the significance of the Mann-Whitney test
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638042)
