fre
TQMP
Tutorials in Quantitative Methods for Psychology
1913-4126
2012-10-03
8
3
137
150
10.20982/tqmp.08.3.p137
article
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
Ferland, Pierre
Louis_Laurencelle@UQTR.CA
1
Laurencelle, Louis
Louis_Laurencelle@UQTR.CA
2
Agence de la santé et des services sociaux de la Mauricie et du Centre-du-Québec
Université du Québec à Trois-Rivières
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, rank-based tests or normal-family 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 back-up mechanism turns out to be the simplest and most efficient to test the difference at the alpha level, with a time-cost generally cut down by a factor better than 1–alpha.
https://www.tqmp.org/RegularArticles/vol08-3/p137/p137.pdf
statistical tests
permutation test
mean test