An extended class of permutation techniques for matched pairs
An extended class of permutation techniques for matched pairs
复制标题
匹配对的排列技术的扩展类别
DOI：
10.1080/03610928208828305
复制
发表时间：
1982
影响因子：
0.8
通讯作者：
K. J. Berry
中科院分区：
文献类型：
--
作者：
P. Mielke;K. J. Berry
考虑一类基于每对观测符号值之间距离的匹配对置换技术。虽然许多常用的匹配对的推理技术都属于这一类，但这一类中一些更吸引人的推理技术却很少受到关注。两个新的简单的秩检验，这类共同拥有直观的属性和位置的替代电源特性，出现更有吸引力的符号测试或Wllcoxon符号秩检验的相应特性。特别是，基于slula-tions的功率比较表明，这些新的秩检验是共同的好，甚至大大上级符号检验或Wilcoxon符号秩检验的位置选择涉及五个对称分布。这些比较所选择的五种分布包括拉普拉斯分布、逻辑斯谛分布、正态分布、均匀分布和U形分布
A class of matched-pairs permutation techniques based on distances between each pair of observed signed values is considered. Although many commonly-used inference techniques for matched pairs are members of this class, some of the more appealing inference techniques among this class have received very little attention. Two new simple rank tests of this class jointly possess both intuitive properties and location-alternative power characteristics which appear more appealing than the corresponding characteristics of either the sign test or the Wllcoxon signed-ranks test. In particular, power comparisons based on slmula-tions indicate that these new rank tests are jointly as good or even vastly superior to the sign test or the Wilcoxon signed-ranks test for location alternatives involving five symmetric distributions. The five distributions selected for these com-parisons include the Laplace, logistic, normal, uniform and a U-shaped distribution