GRAY CODES FOR RANDOMIZATION PROCEDURES

被引：22

作者：

DIACONIS, P

HOLMES, S

机构：

[1] INRA,UNITE BIOMETRIE,F-34060 MONTPELLIER,FRANCE

[2] HARVARD UNIV,DEPT MATH,CAMBRIDGE,MA 02138

[3] STANFORD UNIV,DEPT STAT,STANFORD,CA 94305

来源：

STATISTICS AND COMPUTING | 1994年 / 4卷 / 04期

关键词：

BOOTSTRAP; GRAY-CODE; LOW RANK UPDATE; PERMUTATION TEST;

D O I：

10.1007/BF00156752

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We introduce a simple combinatorial scheme for systematically running through a complete enumeration of sample reuse procedures such as the bootstrap, Hartigan's subsets, and various permutation tests. The scheme is based on Gray codes which give 'tours' through various spaces, changing only one or two points at a time. We use updating algorithms to avoid recomputing statistics and achieve substantial speedups. Several practical examples and computer codes are given.

引用

页码：287 / 302

页数：16

共 56 条

[31] EFFICIENCY IN SUBSAMPLING
GORDON, L
[J]. ANNALS OF STATISTICS, 1974, 2 (04) : 739 - 750
[32] GRAHAM RL, 1990, J ROY STAT SOC B MET, V52, P185
[33] GRAY F, 1939, BELL SYSTEM TECHNICA
[34] HALL P, 1988, BIOMETRIKA, V75, P661
[35] Hall P, 1992, BOOTSTRAP EDGEWORTH
[36] USING SUBSAMPLE VALUES AS TYPICAL VALUES
HARTIGAN, JA
[J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1969, 64 (328) : 1303 - &
[37] A GRAY CODE FOR COMPOSITIONS
KLINGSBERG, P
[J]. JOURNAL OF ALGORITHMS, 1982, 3 (01) : 41 - 44
[38] GENERATING PERMUTATIONS OF A BAG BY INTERCHANGES
KO, CW
RUSKEY, F
[J]. INFORMATION PROCESSING LETTERS, 1992, 41 (05) : 263 - 269
[39] LEHMANN EL, 1975, NONPARAMETRICS
[40] Manly BFJ., 1991, RANDOMIZATION MONTE

← 1 2 3 4 5 6 →