Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Tests for Order Restrictions in Binary Data

Tests for Order Restrictions in Binary Data Summary. In this article, a general procedure is presented for testing for equality of k independent 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Biometrics Oxford University Press

Tests for Order Restrictions in Binary Data

Loading next page...
 
/lp/ou-press/tests-for-order-restrictions-in-binary-data-7VQUNgZCFr

References (33)

Publisher
Oxford University Press
Copyright
Copyright © 2001 Wiley Subscription Services, Inc., A Wiley Company
ISSN
0006-341X
eISSN
1541-0420
DOI
10.1111/j.0006-341x.2001.01219.x
Publisher site
See Article on Publisher Site

Abstract

Summary. In this article, a general procedure is presented for testing for equality of k independent 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.

Journal

BiometricsOxford University Press

Published: Dec 1, 2001

There are no references for this article.