Tests for order restrictions in binary data.
Tests for order restrictions in binary data.
复制标题
测试二进制数据中的顺序限制。
DOI：
10.1111/j.0006-341x.2001.01219.x
复制
发表时间：
2001
期刊：
影响因子：
1.9
通讯作者：
Conaway,M
中科院分区：
文献类型：
--
作者：
Peddada,SD;Prescott,KE;Conaway,M
在这篇文章中，给出了一种检验依赖于Kin的二元响应概率相对于任何给定的有序选择是否相等的一般方法。建议的方法基于Hwang和Peddada(1994，《统计年鉴》22，67-93)中发展的估计程序，可用于非常广泛的顺序限制。通过对两个数据集的应用说明了该过程，这两个数据集对应于三个常见的顺序限制：简单树顺序、简单顺序和降序。
In this article, a general procedure is presented for testing for equality ofkindependent binary response probabilities against any given ordered alternative. The proposed methodology is based on an estimation procedure developed in Hwang and Peddada (1994,Annals of Statistics22, 67–93) and can be used for a very broad class of order restrictions. The procedure is illustrated through application to two data sets that correspond to three commonly encountered order restrictions: simple tree order, simple order, and down turn order.