top banner top banner
index
RegularArticles
ReplicationStudies
SpecialIssues
Vignettes
EditorialBoard
Instructions4Authors
JournalGuidelines
Messages
Submission
Search publications
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
137-150
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, 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.

Pages © TQMP;
Website last modified: 2024-07-14.
Template last modified: 2022-03-04 18h27.
Page consulted on .
Be informed of the upcoming issues with RSS feed: RSS icon RSS