%0 Journal Article
%T 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
%A Pierre Ferland
%A Louis Laurencelle
%J Tutorials in Quantitative Methods for Psychology
%D 2012
%I Universit¨¦ de Montr¨¦al
%X 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.
%K statistical tests
%K permutation test
%K mean test
%U http://www.tqmp.org/Content/vol08-3/p137/p137.pdf