An Algorithm for the Discrete Fisher's Permutation Test.
Abstract
An algorithm, especially suitable for a computer, is presented for carrying out Fisher's two-sample permutation test for non-negative integer-valued data. It is shown that the same method can be applied to carry out the permutation Wilcoxon test, using average ranks. Some numerical examples are given and an optimal property of the permutation test is indicated. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1977
- Accession Number
- ADA042706
Entities
People
- Andrew P. Soms
Organizations
- University of Wisconsin–Madison