
Un algorithme efficace pour la comparaison de deux moyennes indépendantes par combinatoire exhaustive; Highly efficient algorithms for the exact randomization test of the difference between two independent means
Full text PDF
Bibliographic information:
BibTEX format
RIS format
XML format
APA style
Cited references information:
BibTEX format
APA style
Doi:
10.20982/tqmp.08.3.p137
Ferland, Pierre
, Laurencelle, Louis
137150
Keywords:
statistical tests
, permutation test
, mean test
(no sample data)
(no appendix)
Exact randomization tests in their naïve implementation impose a computation burden that makes them generally prohibitive, forcing the researcher to choose between approximate (i.e. incomplete) randomization tests, rankbased tests or normalfamily approximations. The algebra and enumeration algorithm for the comparison of two independent means are minutely analysed, and several reduction and acceleration principles are proposed. A sequential backup mechanism turns out to be the simplest and most efficient to test the difference at the alpha level, with a timecost generally cut down by a factor better than 1–alpha.
