top banner top banner
index
RegularArticles
ReplicationStudies
EditorialBoard
Instructions4Authors
JournalGuidelines
Messages
Submission

Search publications

Randomization test of mean is compuationally inaccessible when the number of groups exceeds two

Full text PDF
Bibliographic information: BibTEX format RIS format XML format APA style
Cited references information: BibTEX format APA style
Doi: 10.20982/tqmp.07.1.p015

Cousineau, Denis
15-18
Keywords: Randomization test , statistics
(no sample data)   (no appendix)

With the advent of fast computers, the randomization test of mean (also called the permutation test) received some attention in the recent years. Here we show that the randomization test is possible only for two-group design; comparing three groups requires a number of permutations so vast that even three groups of ten participants is beyond the current capabilities of modern computers. Further, we show that the rate of increase in the number of permutation is so large that simply adding one more participant per group to the data results in a computation time increased by at least one order of magnitude (in the three-group design) or more. Hence, the exhaustive randomization test may never be a viable alternative to ANOVAs.


Pages © TQMP;
Template last modified: 2017-03-12.
Page consulted on .
Be informed of the upcoming issues with RSS feed: RSS icon RSS