Fast approximation of small p-values in permutation tests by partitioning the permutations
Fast approximation of small p-values in permutation tests by partitioning the permutations
复制标题
DOI：
10.1111/biom.12731
复制
发表时间：
2018-03-01
期刊：
影响因子：
1.9
通讯作者：
Jiang, Hui
中科院分区：
文献类型：
--
作者：
Segal, Brian D.;Braun, Thomas;Jiang, Hui
遗传学和其他生命科学的研究人员通常使用排列测试来评估群体之间的差异。置换检验具有理想的性质，包括数据可交换时的精确性，并且即使当检验统计量的分布在分析上难以处理时也适用。然而，置换测试可能是计算密集型的。我们提出了一个渐近近似和一个快速估计小排列p值（例如，
Researchers in genetics and other life sciences commonly use permutation tests to evaluate differences between groups. Permutation tests have desirable properties, including exactness if data are exchangeable, and are applicable even when the distribution of the test statistic is analytically intractable. However, permutation tests can be computationally intensive. We propose both an asymptotic approximation and a resampling algorithm for quickly estimating small permutation p-values (e.g.,