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
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 algorit...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Université d'Ottawa
2012-10-01
|
| Series: | Tutorials in Quantitative Methods for Psychology |
| Subjects: | |
| Online Access: | http://www.tqmp.org/Content/vol08-3/p137/p137.pdf |