Permutation tests - a revival?! II: An efficient algorithm for computing the critical region (Q1381186): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02925374 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2324772121 / rank | |||
Normal rank | |||
Latest revision as of 11:18, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Permutation tests - a revival?! II: An efficient algorithm for computing the critical region |
scientific article |
Statements
Permutation tests - a revival?! II: An efficient algorithm for computing the critical region (English)
0 references
12 May 1998
0 references
Continuing part I of their paper, see the preceding entry, Zbl 0977.62047, here the authors formulate an algorithm for the two-sample problem that is dealt with in Part I. The proposed algorithm avoids the explicit consideration of all permutations for constructing the critical region. The algorithm itself is due to \textit{M. Pagano} and \textit{D. Tritchler} [J. Am. Stat. Assoc. 78, 435-440 (1983; Zbl 0517.62030)]. The performance of this algorithm is studied and compared with the performance of the Green-algorithm [cf. Am. Stat. 31, 37-39 (1977)].
0 references
Green-algorithm
0 references
